Recommendations
Cited in
(21)- Orthogonal range searching in linear and almost-linear space
- Fast and simple compact hashing via bucketing
- Space-efficient B trees via load-balancing
- On the succinct representation of equivalence classes
- Compressed data structures: Dictionaries and data-aware measures
- Rank and select revisited and extended
- Tube representations of ordered sets
- More on balanced diets
- scientific article; zbMATH DE number 4014779 (Why is no real title available?)
- Compressed Data Structures for Dynamic Sequences
- An efficient algorithm for saving ordered sets in a compacted form
- scientific article; zbMATH DE number 3929218 (Why is no real title available?)
- Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
- scientific article; zbMATH DE number 1161259 (Why is no real title available?)
- scientific article; zbMATH DE number 3993648 (Why is no real title available?)
- Representation transformations of ordered lists
- Space-efficient B trees via load-balancing
- (Worst-case) optimal adaptive dynamic bitvectors
- Rank/select on dynamic compressed sequences and applications
- New method in information processing for maintaining an efficient dynamic ordered set
- Bounded ordered dictionaries in O(log log N) time and O(n) space
This page was built for publication: Compact representations of ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501237)
