65 citations · 333 across the 44 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
Run Compressed Rank/Select for Large Alphabets
José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov +1
Given a string of length that is composed of runs of letters from the alphabet such that , we describe a data structure that, provided…
cs.DS2017
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga +3
We investigate two closely related LZ78-based compression schemes: LZMW (an old scheme by Miller and Wegman) and LZD (a recent variant by Goto et al.). Both LZD and LZMW naturally…
cs.DS2017
m-Bonsai: a Practical Compact Dynamic Trie
Andreas Poyias, Simon J. Puglisi, Rajeev Raman
We consider the problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance. For a trie with nodes with an alphabet of size , the…