Dominik Kempa

Dominik Kempa is an Assistant Professor in the Department of Computer Science at Stony Brook University, NY. He previously held postdoctoral positions at Johns Hopkins University (2021), UC Berkeley (2020), and the University of Warwick (2019). His PhD (2015) and MS (Computer Science) are from the University of Helsinki, while his BS (Mathematics) and MS (Computer Science) are from Jagiellonian University, Kraków.

Research focuses on string algorithms, data compression, compressed data structures, bioinformatics, and parallel/external-memory algorithms. Notable contributions include compressed indexing techniques for large-scale genomic data and theoretical advancements in LZ77 parsing and suffix array construction. He leads projects like the NSF-funded CAREER initiative on scalable compressed sequence indexing.

Key awards include the NSF CAREER Award (2024), Junior Researcher Award, and Outstanding Doctoral Dissertation Award. His work bridges theoretical foundations and practical implementations, with over 30 publications in top venues like STOC, FOCS, and SODA.

• Education: PhD Computer Science (2015, University of Helsinki), MS Computer Science & BS Mathematics (Jagiellonian University)
• Selected Awards: NSF CAREER, Junior Researcher Award
• Professional Activities: Program committee member for STACS, SODA, DCC, and multiple conferences since 2020

Research highlights include resolving the Burrows-Wheeler Transform conjecture (2020) and developing sublinear-time LZ77 factorization (2024).