Recommendations
- Coping with errors in binary search procedures (Preliminary Report)
- An optimal algorithm for finding all the jumps of a monotone step-function
- More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
- Search in an Ordered Array Having Variable Probe Cost
- Unbounded Searching Algorithms
Cites work
Cited in
(18)- Optimal search for rationals
- A randomized algorithm for finding maximum with O(( n)^2) polynomial tests
- On a 2-dimensional search problem
- Modified binary searching for static tables
- How many random questions are necessary to identify n distinct objects?
- scientific article; zbMATH DE number 1629858 (Why is no real title available?)
- Effect of parallelism on the efficiency of binary tree search.
- More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
- Unbounded Searching Algorithms
- Searching Semisorted Tables
- A Binary Search with a Parallel Recovery of the Bits
- scientific article; zbMATH DE number 637529 (Why is no real title available?)
- scientific article; zbMATH DE number 953283 (Why is no real title available?)
- On the functional complexity of a two-dimensional interval search problem
- Generalized Kraft’s Inequality and Discrete k-Modal Search
- scientific article; zbMATH DE number 7120968 (Why is no real title available?)
- The Geometry of Generalized Binary Search
- Searching for a monotone function by independent threshold queries
This page was built for publication: A generalization of binary search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060095)
