Rank-select indices without tears

DOI10.1007/978-3-030-24766-9_7OpenAlexW2965831845MaRDI QIDQ2285085

Tim Baumann, Torben Hagerup

Publication date: 16 January 2020

Full work available at URL: https://arxiv.org/abs/1709.02377

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (4)

Space-efficient vertex separators for treewidth ⋮ Sorting and ranking of self-delimiting numbers with applications to tree isomorphism ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster

This page was built for publication: Rank-select indices without tears