
Breaking the O(n)Barrier in the Construction of Compressed Suffix Arrays
The suffix array, describing the lexicographic order of suffixes of a gi...
read it

Fast and SpaceEfficient Construction of AVL Grammars from the LZ77 Parsing
Grammar compression is, next to LempelZiv (LZ77) and runlength Burrows...
read it

Resolution of the BurrowsWheeler Transform Conjecture
BurrowsWheeler Transform (BWT) is an invertible text transformation tha...
read it

String Synchronizing Sets: SublinearTime BWT Construction and Optimal LCE Data Structure
BurrowsWheeler transform (BWT) is an invertible text transformation tha...
read it

String Attractors: Verification and Optimization
String attractors [STOC 2018] are combinatorial objects recently introdu...
read it

Closing in on Time and Space Optimal Construction of Compressed Indexes
Fast and spaceefficient construction of compressed indexes such as comp...
read it

At the Roots of Dictionary Compression: String Attractors
A wellknown fact in the field of lossless text compression is that high...
read it
Dominik Kempa
is this you? claim profile