Dominik Kempa
Assistant Professor
Department of Computer Science,
Stony Brook University
Email: lastname (at) cs.stonybrook.edu
(replace lastname -> kempa)
About
I am an assistant professor in the Department of Computer Science at Stony Brook University. Prior to joining Stony Brook, I was a postdoc at Johns Hopkins University fortunate to be hosted by Ben Langmead, and before that at UC Berkeley (Theory group), lucky to be advised by Barna Saha.
During my PhD, I implemented a collection of parallel and external-memory algorithms on strings (code: here or Github). As an intern at Google, I worked on data compression. As an undergraduate, I enjoyed algorithm competitions (and practiced here). I am a recipient of the Junior Researcher Award and Outstanding Doctoral Dissertation Award.
Research Interests
String Algorithms
Data Compression
Compressed Data Structures
Bioinformatics
Parallel and External-Memory Algorithms
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 DOI | Arxiv | Slides | Video
Dominik Kempa, Tomasz Kociumaka: String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure, STOC 2019 DOI | Arxiv
Dominik Kempa: Optimal Construction of Compressed Indexes for Highly Repetitive Texts, SODA 2019 DOI | Arxiv | Slides
Dominik Kempa, Nicola Prezza: At the Roots of Dictionary Compression: String Attractors, STOC 2018 DOI | Arxiv
Juha Kärkkäinen, Dominik Kempa: Better External Memory LCP Array Construction, ACM JEA 2019 DOI | Code
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova: Engineering External Memory Induced Suffix Sorting, ALENEX 2017 DOI | Code
Recent Teaching
Co-Instructor, Algorithms for Data Science (UG++)
UC Berkeley, 2020
News
2021/09: I started as an assistant professor in the Department of Computer Science at Stony Brook University!
2021/09: I will be on the PC of the 2022 Data Compression Conference (DCC 2022): Call for papers
2021/06: Paper "Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing" with Ben Langmead accepted to ESA 2021 DOI | Arxiv | Code | Slides | Video
2021/04: I will be on the PC of SPIRE 2021: Call for papers
2021/03: I will give an invited talk at SEA 2021
2021/01: Joined Langmead Lab at Johns Hopkins University!
2020/07: Paper accepted to FOCS 2020 Arxiv
2020/07: Github release of pSAscan, a parallel external-memory algorithm for suffix array construction
2020/07: Code release of fSAIS, and LZ-End parser
2020/06: Our STOC 2019 paper on String Synchronizing Sets and BWT construction featured in "Highlights of CPM" Link
2020/05: I will be on the PC of CSR 2020
2019/06: Invited talk about BWT in Dagstuhl Slides | Seminar