Adaptive succinctness
From MaRDI portal
Publication:2118203
DOI10.1007/s00453-021-00872-1OpenAlexW4249184094MaRDI QIDQ2118203
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00872-1
integer-set compressionsuccinct and compressed data structuressuccinct bit vectorssuccinct rank/select data structures
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient method to evaluate intersections on big data sets
- Ultra-succinct representation of ordered trees with applications
- Optimal indexes for sparse bit vectors
- Huffman coding in bit-vector compression
- Compressed data structures: Dictionaries and data-aware measures
- A Walk Through Combinatorics
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
- Time-space trade-offs for predecessor search
- When indexing equals compression
- On the Redundancy of Succinct Data Structures
- On the Size of Succinct Indices
- Dynamic ordered sets with exponential search trees
- Squeezing succinct data structures into entropy bounds
- Efficient Storage and Retrieval by Content and Address of Static Files
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Compact dictionaries for variable-length keys and data with applications
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- A Data-Aware FM-index
- Engineering the LOUDS Succinct Tree Representation
- Elements of Information Theory
- Codes for the World Wide Web
- Run-length encodings (Corresp.)
This page was built for publication: Adaptive succinctness
