Deterministic dictionaries
From MaRDI portal
Recommendations
Cited in
(49)- Matching subsequences in trees
- An optimal parallel dictionary
- Fast compressed self-indexes with deterministic linear-time construction
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Compressing dictionary matching index via sparsification technique
- Fast and compact regular expression matching
- Construct a perfect word hash function in time independent of the size of integers
- A trade-off for worst-case efficient dictionaries
- scientific article; zbMATH DE number 1617245 (Why is no real title available?)
- Making deterministic signatures quickly
- Resilient dictionaries
- Making deterministic signatures quickly
- Faster lightweight Lempel-Ziv parsing
- scientific article; zbMATH DE number 4129963 (Why is no real title available?)
- scientific article; zbMATH DE number 2089203 (Why is no real title available?)
- The algorithm for identical object searching with bounded worst-case complexity and linear memory
- scientific article; zbMATH DE number 4062630 (Why is no real title available?)
- A distribution-sensitive dictionary with low space overhead
- scientific article; zbMATH DE number 1303598 (Why is no real title available?)
- scientific article; zbMATH DE number 1305431 (Why is no real title available?)
- scientific article; zbMATH DE number 1962771 (Why is no real title available?)
- The saga of minimum spanning trees
- scientific article; zbMATH DE number 2086642 (Why is no real title available?)
- Cache-oblivious dictionaries and multimaps with negligible failure probability
- scientific article; zbMATH DE number 1445338 (Why is no real title available?)
- Uniform deterministic dictionaries
- A subquadratic algorithm for 3XOR
- Nearly Optimal Static Las Vegas Succinct Dictionary
- Simple 2f-Color Choice Dictionaries
- A constant-time colored choice dictionary with almost robust iteration
- A perfect parallel dictionary
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Substring range reporting
- Algorithms – ESA 2004
- Faster query algorithms for the text fingerprinting problem
- Tight tradeoffs in searchable symmetric encryption
- Tight bound for the number of distinct palindromes in a tree
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Compact distance oracles with large sensitivity and low stretch
- Deterministic incremental APSP with polylogarithmic update time and stretch
- Approximate distance sensitivity oracles in subquadratic space
- Approximate distance sensitivity oracles in subquadratic space
- Iceberg hashing: optimizing many hash-table criteria at once
- Almost optimal exact distance oracles for planar graphs
- Fault-tolerant ST-diameter oracles
- A simple optimal representation for balanced parentheses
This page was built for publication: Deterministic dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765957)
