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
Dominik Kempa, Tomasz Kociumaka: Resolution of the Burrows-Wheeler Transform Conjecture, FOCS 2020 Arxiv
Dominik Kempa, Nicola Prezza: At the Roots of Dictionary Compression: String Attractors, STOC 2018 PDF
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
2021/02: I will give an invited talk at SEA 2021
2020/07: Paper accepted to FOCS 2020 Arxiv
2020/07: Github release of pSAscan, a parallel external-memory algorithm for suffix array construction
2020/06: Our STOC 2019 paper on String Synchronizing Sets and fast BWT construction featured in "Highlights of CPM" Link