New trie data structures which support very fast search operations
From MaRDI portal
(Redirected from Publication:794438)
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A priority queue in which initialization and queue operations takeO(loglogD) time
- An algorithmic and complexity analysis of interpolation search
- Binary Search Trees of Bounded Balance
- Design and implementation of an efficient priority queue
- Interpolation search—a log log N search
- Log-logarithmic worst-case range queries are possible in space theta(N)
- New Data Structures for Orthogonal Range Queries
- Polygon Retrieval
- Preserving order in a forest in less than logarithmic time and linear space
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Storing a sparse table
- Understanding the complexity of interpolation search
Cited in
(28)- Scanline algorithms on a grid
- Digital access to comparison-based tree data structures and algorithms
- Fast insertion methods of a double-array structure
- Palindrome pattern matching
- An old sub-quadratic algorithm for finding extremal sets
- scientific article; zbMATH DE number 3894487 (Why is no real title available?)
- Finding extremal sets in less than quadratic time
- Computing runs on a trie
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Approximate covering detection among content-based subscriptions using space filling curves
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Parallel processing can be harmful: The unusual behavior of interpolation search
- Improved behaviour of tries by adaptive branching
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
- Anatree
- Range-restricted mergeable priority queues
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- An improved scheme for set equality testing and updating
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- scientific article; zbMATH DE number 140469 (Why is no real title available?)
- Compressed data structures: Dictionaries and data-aware measures
- Ranking intervals under visibility constraints∗
- A pruned TRIE to index a sorted file and its evaluation
- Surpassing the information theoretic bound with fusion trees
- c-trie++: a dynamic trie tailored for fast prefix searches
- Non-blocking Patricia tries with replace operations
- Trie: An alternative data structure for data mining algorithms
This page was built for publication: New trie data structures which support very fast search operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794438)
