2 citations · 5 across the 10 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Compressing Suffix Trees by Path Decompositions
Ruben Becker, Davide Cenzato, Travis Gagie +4
The suffix tree is arguably the most fundamental data structure on strings: introduced by Weiner (SWAT 1973) and McCreight (JACM 1976), it allows solving a myriad of computational…
cs.DS2025★ 1 cited
PtrHash: Minimal Perfect Hashing at RAM Throughput
Ragnar Groot Koerkamp
Given a set of keys, a minimal perfect hash function (MPHF) is a collision-free bijective map from to . This work presents a (min…
cs.DS2025
U-index: A Universal Indexing Framework for Matching Long Patterns
Lorraine A. K. Ayad, Gabriele Fici, Ragnar Groot Koerkamp +4
Text indexing is a fundamental and well-studied problem. Classic solutions either replace the original text with a compressed representation, e.g., the FM-index and its variants, o…