Constructing Efficient Dictionaries in Close to Sorting Time

DOI10.1007/978-3-540-70575-8_8zbMath1152.68429OpenAlexW2103850023MaRDI QIDQ3521910

No author found.

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (21)

Optimal encodings for range majority queries ⋮ Dictionary Matching in a Stream ⋮ Approximating LZ77 via Small-Space Multiple-Pattern Matching ⋮ Construct a perfect word hash function in time independent of the size of integers ⋮ Alphabet-Dependent String Searching with Wexponential Search Trees ⋮ Motif matching using gapped patterns ⋮ Elastic-degenerate string matching with 1 error ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ The parameterized suffix tray ⋮ Universal compressed text indexing ⋮ \(k\)-abelian pattern matching ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Dispersing hash functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Circular pattern matching with \(k\) mismatches ⋮ Computing runs on a trie ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Suffix trays and suffix trists: structures for faster text indexing

This page was built for publication: Constructing Efficient Dictionaries in Close to Sorting Time