Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominik Kempa
Person information
- affiliation: Stony Brook University, Stony Brook, NY, USA
- affiliation (former): Johns Hopkins University, Department of Computer Science, Baltimore, MD, USA
- affiliation (former): University of California, Berkeley, CA, USA
- affiliation (former): University of Warwick, Department of Computer Science, UK
- affiliation (former, PhD 2015): University of Helsinki, Department of Computer Science, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Rajat De, Dominik Kempa:
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. SODA 2024: 3376-3392- 2023
- [c35]Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS 2023: 1877-1886 - [c34]Dominik Kempa
, Tomasz Kociumaka:
Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. SODA 2023: 5122-5202 - [i18]Rajat De, Dominik Kempa:
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. CoRR abs/2307.08833 (2023) - [i17]Dominik Kempa, Tomasz Kociumaka:
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR abs/2308.03635 (2023) - 2022
- [j9]Dominik Kempa, Tomasz Kociumaka:
Resolution of the burrows-wheeler transform conjecture. Commun. ACM 65(6): 91-98 (2022) - [c33]Dominik Kempa, Barna Saha:
An Upper Bound and Linear-Space Queries on the LZ-End Parsing. SODA 2022: 2847-2866 - [c32]Dominik Kempa, Tomasz Kociumaka:
Dynamic suffix array with polylogarithmic queries and updates. STOC 2022: 1657-1670 - [i16]Dominik Kempa, Tomasz Kociumaka:
Dynamic Suffix Array with Polylogarithmic Queries and Updates. CoRR abs/2201.01285 (2022) - 2021
- [c31]Dominik Kempa, Ben Langmead:
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. ESA 2021: 56:1-56:14 - [i15]Dominik Kempa, Ben Langmead:
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. CoRR abs/2105.11052 (2021) - [i14]Dominik Kempa, Tomasz Kociumaka:
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. CoRR abs/2106.12725 (2021) - 2020
- [c30]Dominik Kempa, Tomasz Kociumaka:
Resolution of the Burrows-Wheeler Transform Conjecture. FOCS 2020: 1002-1013
2010 – 2019
- 2019
- [j8]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica 81(4): 1370-1391 (2019) - [j7]Juha Kärkkäinen, Dominik Kempa:
Better External Memory LCP Array Construction. ACM J. Exp. Algorithmics 24(1): 1.3:1-1.3:27 (2019) - [c29]Dominik Kempa:
Optimal Construction of Compressed Indexes for Highly Repetitive Texts. SODA 2019: 1344-1357 - [c28]Dominik Kempa, Tomasz Kociumaka:
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. STOC 2019: 756-767 - [i13]Dominik Kempa, Tomasz Kociumaka:
String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure. CoRR abs/1904.04228 (2019) - [i12]Dominik Kempa, Tomasz Kociumaka:
Resolution of the Burrows-Wheeler Transform Conjecture. CoRR abs/1910.10631 (2019) - 2018
- [j6]Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - [c27]Héctor Ferrada, Dominik Kempa, Simon J. Puglisi:
Hybrid Indexing Revisited. ALENEX 2018: 1-8 - [c26]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. ESA 2018: 52:1-52:13 - [c25]Dominik Kempa, Nicola Prezza:
At the roots of dictionary compression: string attractors. STOC 2018: 827-840 - [i11]Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg:
String Attractors: Verification and Optimization. CoRR abs/1803.01695 (2018) - 2017
- [j5]Juha Kärkkäinen, Dominik Kempa:
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. Math. Comput. Sci. 11(2): 137-149 (2017) - [c24]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova:
Engineering External Memory Induced Suffix Sorting. ALENEX 2017: 98-108 - [c23]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Compressed Space. DCC 2017: 350-359 - [c22]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Linear Time. ESA 2017: 53:1-53:14 - [c21]Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur:
On the Size of Lempel-Ziv and Lyndon Factorizations. STACS 2017: 45:1-45:13 - [c20]Juha Kärkkäinen, Dominik Kempa:
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. SEA 2017: 17:1-17:14 - [i10]Dominik Kempa, Nicola Prezza:
At the Roots of Dictionary Compression: String Attractors. CoRR abs/1710.10964 (2017) - [i9]Dominik Kempa:
Closing in on Time and Space Optimal Construction of Compressed Indexes. CoRR abs/1712.04886 (2017) - 2016
- [j4]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. ACM J. Exp. Algorithmics 21(1): 1.7:1-1.7:22 (2016) - [j3]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lazy Lempel-Ziv Factorization Algorithms. ACM J. Exp. Algorithmics 21(1): 2.4:1-2.4:19 (2016) - [j2]Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656: 265-278 (2016) - [c19]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Faster, Minuter. DCC 2016: 53-62 - [c18]Juha Kärkkäinen, Dominik Kempa:
Faster External Memory LCP Array Construction. ESA 2016: 61:1-61:16 - [c17]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction Using O(sort(n)) (or Less) I/Os. SPIRE 2016: 204-217 - [c16]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. SEA 2016: 63-74 - [i8]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. CoRR abs/1602.00329 (2016) - [i7]Dominik Kempa, Dmitry Kosolobov:
LZ-End Parsing in Compressed Space. CoRR abs/1611.01769 (2016) - [i6]Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur:
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR abs/1611.08898 (2016) - 2015
- [b1]Dominik Kempa:
Efficient Construction of Fundamental Data Structures in Large-Scale Text Indexing. University of Helsinki, Finland, 2015 - [c15]Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter Bounds for the Sum of Irreducible LCP Values. CPM 2015: 316-328 - [c14]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Parallel External Memory Suffix Sorting. CPM 2015: 329-342 - [c13]Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization Is NP-complete. DLT 2015: 85-96 - [i5]Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. CoRR abs/1503.04045 (2015) - 2014
- [j1]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28: 41-48 (2014) - [c12]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
String Range Matching. CPM 2014: 232-241 - [c11]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Parsing in External Memory. DCC 2014: 153-162 - [c10]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Hybrid Compression of Bitvectors for the FM-Index. DCC 2014: 302-311 - [c9]Juha Kärkkäinen, Dominik Kempa:
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. ICABD 2014: 53-60 - [c8]Tomohiro I, Juha Kärkkäinen, Dominik Kempa:
Faster Sparse Suffix Sorting. STACS 2014: 386-396 - [c7]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. SEA 2014: 412-423 - [i4]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR abs/1403.2431 (2014) - 2013
- [c6]Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv factorization: Simple, fast, practical. ALENEX 2013: 103-112 - [c5]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM 2013: 189-200 - [c4]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. Stringology 2013: 168-175 - [c3]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lightweight Lempel-Ziv Parsing. SEA 2013: 139-150 - [i3]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lightweight Lempel-Ziv Parsing. CoRR abs/1302.1064 (2013) - [i2]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Parsing in External Memory. CoRR abs/1307.1428 (2013) - 2012
- [c2]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Slashing the Time for BWT Inversion. DCC 2012: 99-108 - [c1]Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa:
Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE 2012: 330-335 - [i1]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CoRR abs/1212.2952 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
