Optimal static fully indexable dictionaries
From MaRDI portal
Cites work
- A simple optimal representation for balanced parentheses
- Are Bitvectors Optimal?
- Breaking a time-and-space barrier in constructing full-text indices
- Cell-probe lower bounds for succinct partial sums
- Compact dictionaries for variable-length keys and data with applications
- Compressed data structures: Dictionaries and data-aware measures
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Dynamic ``succincter
- Dynamic dictionary with subconstant wasted bits per key
- Dynamic Elias-Fano representation
- Efficient fully-compressed sequence representations
- Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- scientific article; zbMATH DE number 1830754 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Indexing compressed text
- Modern hashing made simple
- More haste, less waste: lowering the redundancy in fully indexable dictionaries
- Nearly optimal static Las Vegas succinct dictionary
- New sampling lower bounds via the separator
- On the optimal time/space tradeoff for hash tables
- On the Redundancy of Succinct Data Structures
- Optimal lower and upper bounds for representing sequences
- Optimal succinct rank data structure via approximate nonnegative tensor decomposition
- Optimal trade-offs for succinct string indexes
- Rank/select operations on large alphabets
- Simplified tight bounds for monotone minimal perfect hashing
- Space efficient suffix trees
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct ordinal trees with level-ancestor queries
- Succinct representation of balanced parentheses and static trees
- Succinct representations of permutations and functions
- Tight bounds for monotone minimal perfect hashing
- Tight cell-probe lower bounds for dynamic succinct dictionaries
- Time-space trade-offs for predecessor search
This page was built for publication: Optimal static fully indexable dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363202)
