Interpolation search—a log log N search
From MaRDI portal
Publication:4157947
DOI10.1145/359545.359557zbMATH Open0378.68029OpenAlexW2022541337WikidataQ56039264 ScholiaQ56039264MaRDI QIDQ4157947FDOQ4157947
Yehoshua Perl, Alon Itai, Haim Avni
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359545.359557
General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited In (20)
- Jump interpolation search trees and symmetric binary numbers
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Analysis of recursive batched interpolation search
- New trie data structures which support very fast search operations
- Interpolation-binary search
- Controlled density sorting
- Expected complexity of fast search with uniformly distributed data
- Simulating interpolation search
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Dynamic interpolation search revisited
- Operations research applications of dichotomous search
- Title not available (Why is that?)
- Improved bounds for finger search on a RAM
- Parallel processing can be harmful: The unusual behavior of interpolation search
- An adaptation of a root finding method to searching ordered disk files revisited
- Batched interpolation searching on databases
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
- Understanding the complexity of interpolation search
- An algorithmic and complexity analysis of interpolation search
This page was built for publication: Interpolation search—a log log N search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157947)
