Search in an Ordered Array Having Variable Probe Cost
From MaRDI portal
Publication:3823150
DOI10.1137/0217076zbMath0669.68047MaRDI QIDQ3823150
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217076
Related Items
Optimized binary search and text retrieval, An approximation algorithm for binary searching in trees, Trees with exponentially growing costs, A hierarchic family of \(C^ 1\) finite elements for \(4^{th}\) order elliptic problems, Operations research applications of dichotomous search, A strategy for searching with different access costs., Spatiotemporal persistent homology for dynamic metric spaces