Expected complexity of fast search with uniformly distributed data

DOI10.1016/0020-0190(81)90140-XMaRDI QIDQ1156487zbMATH OpenFDO

Authors Gilbert N. Lewis, Nancy J. Boynton, F. Warren Burton

Publication date 1981

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

binomial distributionuniform distributionexpected valuebinary searchinterpolation searchdata access

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Interpolation search—a log log N search
• Understanding the complexity of interpolation search

Cited in

(5)

• Dynamic-window search for real-time simulation of dynamic systems
• Analysis of recursive batched interpolation search
• Fast search algorithms for look‐up tables
• scientific article; zbMATH DE number 3829247 (Why is no real title available?)
• An adaptation of a root finding method to searching ordered disk files revisited

This page was built for publication: Expected complexity of fast search with uniformly distributed data

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