Efficient Storage and Retrieval by Content and Address of Static Files
From MaRDI portal
Publication:4404423
Cited in
(45)- Minimum times and memories needed to compute the values of a function
- Graph compression by BFS
- Ranked document retrieval for multiple patterns
- Time-space trade-offs for compressed suffix arrays.
- New compression schemes for natural number sequences
- Adaptive succinctness
- Grammar index by induced suffix sorting
- Fast and simple compact hashing via bucketing
- Space-efficient B trees via load-balancing
- Improved and extended locating functionality on compressed suffix arrays
- Range selection and predecessor queries in data aware space and time
- Space-efficient substring occurrence estimation
- Grammar-compressed indexes with logarithmic search time
- Optimal encodings for range majority queries
- Compressed string dictionary search with edit distance one
- Locally compressed suffix arrays
- Fast compressed tries through path decompositions
- Ranked document retrieval with forbidden pattern
- Faster and Space-Optimal Edit Distance “1” Dictionary
- Optimal indexes for sparse bit vectors
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Optimal In-place Algorithms for Basic Graph Problems
- Engineering practical Lempel-Ziv tries
- An encoding for order-preserving matching
- Rainbowfish: a succinct colored de Bruijn graph representation
- A grouping approach for succinct dynamic dictionary matching
- Efficient compression and indexing of trajectories
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Compressed string dictionaries via data-aware subtrie compaction
- Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
- An index for sequencing reads based on the colored de Bruijn graph
- PLA-index: a k-mer index exploiting rank curve linearity
- Bat-LZ out of hell
- Dynamic filter and retrieval with one access to modifiable memory
- Space-efficient B trees via load-balancing
- ShockHash: near optimal-space minimal perfect hashing beyond brute-force
- (Worst-case) optimal adaptive dynamic bitvectors
- Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
- NP-completeness on the length of double-arrays and the sparse matrix problem with at least logarithmic alphabets/widths
- Grammar index by induced suffix sorting
- Engineering minimal \(k\)-perfect hash functions
- Compressibility measures and succinct data structures for piecewise linear approximations
- Minimal storage representations for binary relations
- Dynamic dictionaries for multisets and counting filters with constant time operations
- Integer representation and counting in the bit probe model
This page was built for publication: Efficient Storage and Retrieval by Content and Address of Static Files
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404423)
