Dynamic interpolation search revisited
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3637287 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1402212 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3403734 (Why is no real title available?)
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
- A balanced search tree O(1) worst-case update time
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A new data structure for representing sorted lists
- An algorithmic and complexity analysis of interpolation search
- An experimental study of compression methods for dynamic tries
- Computability of Recursive Functions
- Design and implementation of an efficient priority queue
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- Dynamic Interpolation Search Revisited
- Dynamic interpolation search
- Dynamic interpolation search in \(o(\log\log n)\) time
- Dynamic ordered sets with exponential search trees
- Efficiency of a Good But Not Linear Set Union Algorithm
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- Implicit Data Structures for the Dictionary Problem
- Improved behaviour of tries by adaptive branching
- Improved bounds for finger search on a RAM
- Improved bounds for finger search on a RAM
- Interpolation search—a log log N search
- Interpolation-binary search
- Log-logarithmic worst-case range queries are possible in space theta(N)
- On RAM Priority Queues
- Optimal bounds for the predecessor problem and related problems
- Preserving order in a forest in less than logarithmic time and linear space
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Special issue: Average-case analysis of algorithms
- Surpassing the information theoretic bound with fusion trees
- The Ubiquitous Digital Tree
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Time bounded random access machines
- Time-space trade-offs for predecessor search
- Understanding the complexity of interpolation search
- Updating a balanced search tree in 0(1) rotations
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(6)- Dynamic Interpolation Search Revisited
- scientific article; zbMATH DE number 3909753 (Why is no real title available?)
- Dynamic Iterative Pursuit
- scientific article; zbMATH DE number 4062609 (Why is no real title available?)
- Dynamic interpolation search
- Dynamic interpolation search in \(o(\log\log n)\) time
This page was built for publication: Dynamic interpolation search revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288214)
