Deterministic Dictionaries
From MaRDI portal
Publication:2765957
DOI10.1006/jagm.2001.1171zbMath1002.68503OpenAlexW2912435829MaRDI QIDQ2765957
Rasmus Pagh, Peter Bro Miltersen, Torben Hagerup
Publication date: 1 August 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1171
Related Items (22)
Fast and compact regular expression matching ⋮ A simple optimal representation for balanced parentheses ⋮ The algorithm for identical object searching with bounded worst-case complexity and linear memory ⋮ Construct a perfect word hash function in time independent of the size of integers ⋮ Faster Lightweight Lempel-Ziv Parsing ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Unnamed Item ⋮ The saga of minimum spanning trees ⋮ A subquadratic algorithm for 3XOR ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ 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 ⋮ Faster query algorithms for the text fingerprinting problem ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Matching subsequences in trees ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet ⋮ Fast Compressed Self-Indexes with Deterministic Linear-Time Construction ⋮ Compressing dictionary matching index via sparsification technique
This page was built for publication: Deterministic Dictionaries
