Coping with errors in binary search procedures (Preliminary Report)

DOI10.1145/800133.804351MaRDI QIDQ5402561zbMATH OpenOpenAlexWikidataFDO

Authors Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804351

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Binary search with errors and variable cost queries
• scientific article; zbMATH DE number 1003301
• scientific article; zbMATH DE number 1444319
• scientific article; zbMATH DE number 2080238
• Noisy binary search and its applications
• Searching with known error probability
• On binary searching with nonuniform costs
• scientific article; zbMATH DE number 1962791
• Result-Sensitive Binary Search with Noisy Information
• On binary searching with non-uniform costs

Cited in

(14)

• A framework for searching in graphs in the presence of errors
• Perfect minimally adaptive \(q\)-ary search with unreliable tests
• scientific article; zbMATH DE number 4033104 (Why is no real title available?)
• Locally decodable codes for edit distance
• Robust and adaptive search
• Searching with local constraints on error patterns
• Some aspects of the information theoretic dialogue
• Search using queries on indistinguishable items
• Prefix search with a lie
• Searching with known error probability
• A generalization of binary search
• Least adaptive optimal search with unreliable tests
• scientific article; zbMATH DE number 2080238 (Why is no real title available?)
• Binary search with errors and variable cost queries

This page was built for publication: Coping with errors in binary search procedures (Preliminary Report)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402561)