Dominik Kempa

Postdoctoral Fellow (Langmead Lab)
Department of Computer Science,
Johns Hopkins University

Email: lastname (at)
(replace lastname with kempa)

CV, Google Scholar

Short Bio

I am currently a postdoc at Johns Hopkins University fortunate to be hosted by Ben Langmead. Prior to joining JHU, I was a postdoc at the University of California, Berkeley, and before that, and the University of Warwick.

I obtained my PhD in Computer Science in 2015 at the University of Helsinki, under the supervision of Esko Ukkonen and Juha Kärkkäinen. During my PhD, I implemented a collection of parallel and external-memory algorithms on strings (code: here or Github). As an undergraduate, I enjoyed algorithm competitions (and practiced here). I am a recipient of the Junior Researcher Award and Outstanding Doctoral Dissertation Award.

Recent (+Selected) Publications

See the full list here (alternative: Google Scholar, DBLP).

  • Dominik Kempa, Tomasz Kociumaka: Resolution of the Burrows-Wheeler Transform Conjecture, FOCS 2020 Arxiv

  • Dominik Kempa, Tomasz Kociumaka: String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure, STOC 2019 PDF | Arxiv

  • Dominik Kempa: Optimal Construction of Compressed Indexes for Highly Repetitive Texts, SODA 2019 PDF | Slides

  • Dominik Kempa, Nicola Prezza: At the Roots of Dictionary Compression: String Attractors, STOC 2018 PDF

  • Juha Kärkkäinen, Dominik Kempa: Better External Memory LCP Array Construction, ACM JEA 2019 View | Code

  • Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova: Engineering External Memory Induced Suffix Sorting, ALENEX 2017 View | Code

Research Interests

String Algorithms, Data Compression, Compressed Data Structures, Bioinformatics, Parallel and External-Memory Algorithms. A one-slide summary of Compressed Indexing, one of the most exciting recent topics that I am interested in: View


Recent Teaching