Compact binary relation representations with rich functionality
From MaRDI portal
Publication:386006
DOI10.1016/J.IC.2013.10.003zbMath1277.68063arXiv1201.3602OpenAlexW2116258248MaRDI QIDQ386006
Francisco Claude, Gonzalo Navarro, Jérémy Barbay
Publication date: 13 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.3602
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (6)
Succinct posets ⋮ A succinct data structure for self-indexing ternary relations ⋮ Grammar compressed sequences with rank/select support ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Longest Common Prefix with Mismatches ⋮ Wavelet trees for all
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Towards optimal range medians
- Succinct representation of labeled graphs
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- Fully Functional Static and Dynamic Succinct Trees
- Sorted Range Reporting
- Compressed representations of sequences and full-text indexes
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Entropy-Bounded Representation of Point Grids
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct indexes for strings, binary relations and multilabeled trees
- Self-Indexed Grammar-Based Compression
- On the Redundancy of Succinct Data Structures
- Compact Rich-Functional Binary Relation Representations
- Extended Compact Web Graph Representations
- Rank/select operations on large alphabets
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Optimal Dynamic Sequence Representations
- COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
- Orthogonal range searching on the RAM, revisited
- An experimental investigation of set intersection algorithms for text searching
This page was built for publication: Compact binary relation representations with rich functionality
