Fast search algorithms for look‐up tables

DOI10.1108/02644400310467180MaRDI QIDQ4467352zbMATH OpenOpenAlexFDO

Authors Sugjoon Yoon, Hyunjoo Kang

Publication date 9 June 2004

Published in Engineering Computations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/02644400310467180

zbMATH Keywords

searching algorithmsinterpolationnumerical examplesdynamic systemsbisectiondata distributiondata tablesregula falsi search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Dynamic-window search for real-time simulation of dynamic systems
• Interpolation-binary search
• scientific article; zbMATH DE number 4062609
• An adaptation of a root finding method to searching ordered disk files revisited
• Batched interpolation searching on databases

Cites work

• scientific article; zbMATH DE number 108390 (Why is no real title available?)
• scientific article; zbMATH DE number 3338857 (Why is no real title available?)
• An algorithmic and complexity analysis of interpolation search
• Expected complexity of fast search with uniformly distributed data
• Understanding the complexity of interpolation search

Cited in

(2)

• scientific article; zbMATH DE number 1629858 (Why is no real title available?)
• Modified binary searching for static tables

This page was built for publication: Fast search algorithms for look‐up tables

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