The following pages link to A generalization of binary search (Q5060095):
Displaying 11 items.
- Optimal search for rationals (Q1007565) (← links)
- A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests (Q1313712) (← links)
- On a 2-dimensional search problem (Q1329699) (← links)
- Modified binary searching for static tables (Q1608338) (← links)
- How many random questions are necessary to identify \(n\) distinct objects? (Q1813292) (← links)
- (Q2728903) (← links)
- A Binary Search with a Parallel Recovery of the Bits (Q3747741) (← links)
- On the functional complexity of a two-dimensional interval search problem (Q4809560) (← links)
- (Q5239684) (← links)
- The Geometry of Generalized Binary Search (Q5272208) (← links)
- Searching for a monotone function by independent threshold queries (Q6487974) (← links)