Dynamic interpolation search

DOI10.1145/174130.174139MaRDI QIDQ3140019zbMATH OpenOpenAlexFDO

Authors K. 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

dynamizationinterpolation searchtrees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3909753
• Dynamic interpolation search in o( n) time
• Dynamic interpolation search revisited
• Dynamic Interpolation Search Revisited
• scientific article; zbMATH DE number 6469186

Cited in

(12)

• Interpolation-binary search
• Improved bounds for finger search on a RAM
• Adaptive search over sorted sets
• Dynamic interpolation search revisited
• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
• Dynamic Interpolation Search Revisited
• Some Results for Elementary Operations
• scientific article; zbMATH DE number 3909753 (Why is no real title available?)
• Dynamic interpolation search in o( n) time
• scientific article; zbMATH DE number 6469186 (Why is no real title available?)
• ISB-tree: A new indexing scheme with efficient expected behaviour

This page was built for publication: Dynamic interpolation search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140019)