Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Space Efficient Construction of Lyndon Arrays in Linear Time
Philip Bille, Jonas Ellert, Johannes Fischer +4
We present the first linear time algorithm to construct the -bit version of the Lyndon array for a string of length using only bits of working space. A simpler varia…
cs.DS2019
Bidirectional Text Compression in External Memory
Patrick Dinklage, Jonas Ellert, Johannes Fischer +2
Bidirectional compression algorithms work by substituting repeated substrings by references that, unlike in the famous LZ77-scheme, can point to either direction. We present such a…