Compact representations of ordered sets

zbMATH Open1317.68040MaRDI QIDQ5501237FDOQ5501237

Authors: Daniel K. Blandford, Guy E. Blelloch 

Publication date: 3 August 2015

Recommendations

• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• scientific article; zbMATH DE number 2038723
• Dynamic ordered sets with exponential search trees
• Dynamic Elias-Fano representation
• Bounded ordered dictionaries in O(log log N) time and O(n) space

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Cited In (18)

• Bounded ordered dictionaries in O(log log N) time and O(n) space
• Space-efficient B trees via load-balancing
• Tube representations of ordered sets
• Orthogonal range searching in linear and almost-linear space
• Title not available (Why is that?)
• New method in information processing for maintaining an efficient dynamic ordered set
• Compressed Data Structures for Dynamic Sequences
• On the succinct representation of equivalence classes
• An efficient algorithm for saving ordered sets in a compacted form
• More on balanced diets
• Rank/select on dynamic compressed sequences and applications
• Title not available (Why is that?)
• Rank and select revisited and extended
• Representation transformations of ordered lists
• Compressed data structures: Dictionaries and data-aware measures
• Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
• Title not available (Why is that?)
• Fast and simple compact hashing via bucketing

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)