Dominik Kempa - RankMe

79 papers A* 14A 10B 14C 3Misc 1Journal 35Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text. ALENEX Ankith Reddy Adudodla, Dominik Kempa
2026	A*	`conf`	Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. SODA Dominik Kempa, Tomasz Kociumaka
2026	A*	`conf`	Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings. SODA Rajat De, Dominik Kempa
2026	A*	`conf`	Tight Lower Bounds for Central String Queries in Compressed Space. SODA Dominik Kempa, Tomasz Kociumaka
2025	J	`jnl`	Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text. CoRR Ankith Reddy Adudodla, Dominik Kempa
2025	J	`jnl`	Engineering Select Support for Hybrid Bitvectors. CoRR Eric Chiu, Dominik Kempa
2025	J	`jnl`	Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. CoRR Dominik Kempa, Tomasz Kociumaka
2025	J	`jnl`	On the Hardness Hierarchy for the O(n √(log n)) Complexity in the Word RAM. CoRR Dominik Kempa, Tomasz Kociumaka
2025	A*	`conf`	On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. STOC Dominik Kempa, Tomasz Kociumaka
2025	J	`jnl`	Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings. CoRR Rajat De, Dominik Kempa
2025	J	`jnl`	Tight Lower Bounds for Central String Queries in Compressed Space. CoRR Dominik Kempa, Tomasz Kociumaka
2025	B	`conf`	Word Break on SLP-Compressed Texts. DCC Rajat De, Dominik Kempa
2025	J	`jnl`	Word Break on SLP-Compressed Texts. CoRR Rajat De, Dominik Kempa
2024	A*	`conf`	Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. SODA Rajat De, Dominik Kempa
2024	A*	`conf`	Lempel-Ziv (LZ77) Factorization in Sublinear Time. FOCS Dominik Kempa, Tomasz Kociumaka
2024	J	`jnl`	Lempel-Ziv (LZ77) Factorization in Sublinear Time. CoRR Dominik Kempa, Tomasz Kociumaka
2023	A*	`conf`	Breaking the 𝒪( SODA Dominik Kempa, Tomasz Kociumaka
2023	A*	`conf`	Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS Dominik Kempa, Tomasz Kociumaka
2023	J	`jnl`	Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR Dominik Kempa, Tomasz Kociumaka
2023	J	`jnl`	Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. CoRR Rajat De, Dominik Kempa
2022	A*	`conf`	An Upper Bound and Linear-Space Queries on the LZ-End Parsing. SODA Dominik Kempa, Barna Saha
2022	J	`jnl`	Dynamic Suffix Array with Polylogarithmic Queries and Updates. CoRR Dominik Kempa, Tomasz Kociumaka
2022	A*	`conf`	Dynamic suffix array with polylogarithmic queries and updates. STOC Dominik Kempa, Tomasz Kociumaka
2022	J	`jnl`	Resolution of the burrows-wheeler transform conjecture. Commun. ACM Dominik Kempa, Tomasz Kociumaka
2021	J	`jnl`	Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. CoRR Dominik Kempa, Tomasz Kociumaka
2021	A	`conf`	Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. ESA Dominik Kempa, Ben Langmead
2021	J	`jnl`	Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. CoRR Dominik Kempa, Ben Langmead
2020	A*	`conf`	Resolution of the Burrows-Wheeler Transform Conjecture. FOCS Dominik Kempa, Tomasz Kociumaka
2019	J	`jnl`	Better External Memory LCP Array Construction. ACM J. Exp. Algorithmics Juha Kärkkäinen, Dominik Kempa
2019	J	`jnl`	Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
2019	A*	`conf`	Optimal Construction of Compressed Indexes for Highly Repetitive Texts. SODA Dominik Kempa
2019	J	`jnl`	Resolution of the Burrows-Wheeler Transform Conjecture. CoRR Dominik Kempa, Tomasz Kociumaka
2019	J	`jnl`	String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure. CoRR Dominik Kempa, Tomasz Kociumaka
2019	A*	`conf`	String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. STOC Dominik Kempa, Tomasz Kociumaka
2018	A*	`conf`	At the roots of dictionary compression: string attractors. STOC Dominik Kempa, Nicola Prezza
2018	J	`jnl`	Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
2018	A	`conf`	Hybrid Indexing Revisited. ALENEX Héctor Ferrada, Dominik Kempa, Simon J. Puglisi
2018	A	`conf`	String Attractors: Verification and Optimization. ESA Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
2018	J	`jnl`	String Attractors: Verification and Optimization. CoRR Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
2017	J	`jnl`	At the Roots of Dictionary Compression: String Attractors. CoRR Dominik Kempa, Nicola Prezza
2017	J	`jnl`	Closing in on Time and Space Optimal Construction of Compressed Indexes. CoRR Dominik Kempa
2017	A	`conf`	Engineering External Memory Induced Suffix Sorting. ALENEX Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova
2017	B	`conf`	Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. SEA Juha Kärkkäinen, Dominik Kempa
2017	J	`jnl`	Engineering a Lightweight External Memory Suffix Array Construction Algorithm. Math. Comput. Sci. Juha Kärkkäinen, Dominik Kempa
2017	B	`conf`	LZ-End Parsing in Compressed Space. DCC Dominik Kempa, Dmitry Kosolobov
2017	A	`conf`	LZ-End Parsing in Linear Time. ESA Dominik Kempa, Dmitry Kosolobov
2017	A	`conf`	On the Size of Lempel-Ziv and Lyndon Factorizations. STACS Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
2016	A	`conf`	Faster External Memory LCP Array Construction. ESA Juha Kärkkäinen, Dominik Kempa
2016	B	`conf`	Faster, Minuter. DCC Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
2016	C	`conf`	LCP Array Construction Using O(sort(n)) (or Less) I/Os. SPIRE Juha Kärkkäinen, Dominik Kempa
2016	J	`jnl`	LCP Array Construction in External Memory. ACM J. Exp. Algorithmics Juha Kärkkäinen, Dominik Kempa
2016	J	`jnl`	LZ-End Parsing in Compressed Space. CoRR Dominik Kempa, Dmitry Kosolobov
2016	J	`jnl`	Lazy Lempel-Ziv Factorization Algorithms. ACM J. Exp. Algorithmics Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2016	B	`conf`	Lempel-Ziv Decoding in External Memory. SEA Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2016	J	`jnl`	Lempel-Ziv Decoding in External Memory. CoRR Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2016	J	`jnl`	On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
2016	J	`jnl`	Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
2015	C	`conf`	Diverse Palindromic Factorization Is NP-complete. DLT Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
2015	J	`jnl`	Diverse Palindromic Factorization is NP-Complete. CoRR Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
2015	—	`—`	Efficient Construction of Fundamental Data Structures in Large-Scale Text Indexing. Dominik Kempa
2015	B	`conf`	Parallel External Memory Suffix Sorting. CPM Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2015	B	`conf`	Tighter Bounds for the Sum of Irreducible LCP Values. CPM Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
2014	J	`jnl`	A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa
2014	J	`jnl`	A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa
2014	—	`conf`	Engineering a Lightweight External Memory Suffix Array Construction Algorithm. ICABD Juha Kärkkäinen, Dominik Kempa
2014	A	`conf`	Faster Sparse Suffix Sorting. STACS Tomohiro I, Juha Kärkkäinen, Dominik Kempa
2014	B	`conf`	Hybrid Compression of Bitvectors for the FM-Index. DCC Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2014	B	`conf`	LCP Array Construction in External Memory. SEA Juha Kärkkäinen, Dominik Kempa
2014	B	`conf`	Lempel-Ziv Parsing in External Memory. DCC Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2014	B	`conf`	String Range Matching. CPM Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2013	Misc	`conf`	Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. PSC Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2013	J	`jnl`	Lempel-Ziv Parsing in External Memory. CoRR Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2013	A	`conf`	Lempel-Ziv factorization: Simple, fast, practical. ALENEX Dominik Kempa, Simon J. Puglisi
2013	J	`jnl`	Lightweight Lempel-Ziv Parsing CoRR Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2013	B	`conf`	Lightweight Lempel-Ziv Parsing. SEA Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2013	B	`conf`	Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2012	C	`conf`	Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa
2012	J	`jnl`	Linear Time Lempel-Ziv Factorization: Simple, Fast, Small CoRR Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
2012	B	`conf`	Slashing the Time for BWT Inversion. DCC Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi