A generalization of binary search

DOI10.1007/3-540-57155-8_232MaRDI QIDQ5060095zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

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

• An optimal algorithm for finding all the jumps of a monotone step-function
• On the Optimality of Huffman Trees

Cited in

(14)

• On a 2-dimensional search problem
• Optimal search for rationals
• Modified binary searching for static tables
• 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(( 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
• scientific article; zbMATH DE number 7120968 (Why is no real title available?)
• Unbounded Searching Algorithms
• Searching for a monotone function by independent threshold queries
• scientific article; zbMATH DE number 1629858 (Why is no real title available?)

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)