On the succinct representation of equivalence classes
From MaRDI portal
Publication:2408100
DOI10.1007/s00453-016-0192-1zbMath1372.68073OpenAlexW2220972252MaRDI QIDQ2408100
J. Ian Munro, Timothy M. Chan, Moshe Lewenstein, Hicham El-Zein, Venkatesh Raman
Publication date: 9 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10012/8999
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Representing trees of higher degree
- Fusion trees can be implemented with \(AC^0\) instructions only
- Surpassing the information theoretic bound with fusion trees
- Log-logarithmic worst-case range queries are possible in space theta(N)
- A uniform paradigm to succinctly encode various families of trees
- Compressed data structures: Dictionaries and data-aware measures
- Space Efficient Suffix Trees
- Worst-case and amortised optimality in union-find (extended abstract)
- Succinct Posets
- Radix Sorting with No Extra Space
- Succinct Representations of Arbitrary Graphs
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
- Implicat Representation of Graphs
- Universal codeword sets and representations of the integers
- Membership in Constant Time and Almost-Minimum Space
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Labeling Schemes for Flow and Connectivity
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Succinct Representation of Labeled Graphs
- More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
This page was built for publication: On the succinct representation of equivalence classes
