Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, UK

Email: F (dot) L (at) warwick (dot) ac (dot) uk (where F is my first name and L is my last name)

Short CV

I am currently a postdoc at the University of Warwick, UK. I obtained my PhD at the University of Helsinki (2015). Prior to that I was an Intern in Google (Zurich) working on data compression. I obtained my BSc (Mathematics) and MSc (CS) from Jagiellonian University in Poland.

I am interested in theoretical aspects (algorithms and data structures, hardness of approximation, lower bounds) of sequence analysis (this includes, e.g., string indexing, lossless data compression, bioinformatics, and information theory).

During my PhD I implemented a collection of parallel and external-memory algorithms for string problems, most of which are available here. During my undergraduate studies I enjoyed programming competitions (and practised here).

Recent Publications

  • Dominik Kempa, Tomasz Kociumaka: String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure, STOC 2019 (ACM, arxiv)
  • Dominik Kempa: Optimal Construction of Compressed Indexes for Highly Repetitive Texts, SODA 2019 (link)
  • Dominik Kempa, Nicola Prezza: At the Roots of Dictionary Compression: String Attractors, STOC 2018 (ACM, arxiv)
  • Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg: String Attractors: Verification and Optimization, ESA 2018 (link)

See DBLP or Google Scholar for a full list.