A generalization of binary search
From MaRDI portal
Publication:5060095
DOI10.1007/3-540-57155-8_232zbMATH Open1504.68051OpenAlexW1537300939MaRDI QIDQ5060095FDOQ5060095
Authors: Richard Karp 
Publication date: 18 January 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57155-8_232
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 (14)
- On a 2-dimensional search problem
- Modified binary searching for static tables
- Optimal search for rationals
- Effect of parallelism on the efficiency of binary tree search.
- More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
- Searching Semisorted Tables
- A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests
- A Binary Search with a Parallel Recovery of the Bits
- The Geometry of Generalized Binary Search
- On the functional complexity of a two-dimensional interval search problem
- Title not available (Why is that?)
- Searching for a monotone function by independent threshold queries
- Unbounded Searching Algorithms
- Title not available (Why is that?)
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)
