Expected complexity of fast search with uniformly distributed data
From MaRDI portal
Publication:1156487
DOI10.1016/0020-0190(81)90140-XzbMath0468.68061MaRDI QIDQ1156487
Gilbert N. Lewis, Nancy J. Boynton, F. Warren Burton
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Unnamed Item ⋮ Analysis of recursive batched interpolation search ⋮ Dynamic-window search for real-time simulation of dynamic systems ⋮ Fast search algorithms for look‐up tables ⋮ An adaptation of a root finding method to searching ordered disk files revisited
Cites Work