Grants & Projects per year
Personal profile
Fingerprint
Dive into the research topics where Dominik Kempa is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Grants & Projects
- 1 Active
-
CAREER: Scalable and Flexible Indexing of Compressed Sequences
Kempa, D. (PI)
03/1/24 → 02/28/29
Project: Research
-
Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
Adudodla, A. R. & Kempa, D., 2026, SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2026. Society for Industrial and Applied Mathematics Publications, p. 222-232 11 p. (Proceedings of the Workshop on Algorithm Engineering and Experiments).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
Kempa, D. & Kociumaka, T., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 1841-1858 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Fast Select Queries Using Hybrid Bitvectors
Chiu, E. & Kempa, D., Jun 15 2026, 24th International Symposium on Experimental Algorithms, SEA 2026. Aumuller, M. & Finocchi, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 371).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Hardness of Frequency-Related Queries on Compressed Strings
De, R. & Kempa, D., Aug 25 2026, 34th Annual European Symposium on Algorithms, ESA 2026. Bille, P., Pettie, S. & Storand, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 143. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 388).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
De, R. & Kempa, D., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 1903-1915 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review