Dynamic interpolation search

DOI10.1145/174130.174139zbMath0785.68019OpenAlexW2011181252MaRDI QIDQ3140019

Kurt Mehlhorn, Athanasios K. Tsakalidis

Publication date: 6 December 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174130.174139

zbMATH Keywords

treesinterpolation searchdynamization

Mathematics Subject Classification ID

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

Related Items (8)

ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ On the correctness of a lock-free compression-based elastic mechanism for a hash trie design ⋮ Improved bounds for finger search on a RAM ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ Dynamic interpolation search in o(log log n) time ⋮ Adaptive search over sorted sets ⋮ Dynamic interpolation search revisited ⋮ Some Results for Elementary Operations

This page was built for publication: Dynamic interpolation search