Coping with errors in binary search procedures (Preliminary Report)

DOI10.1145/800133.804351zbMath1282.68095OpenAlexW1965859959WikidataQ56039269 ScholiaQ56039269MaRDI QIDQ5402561

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)

Related Items

Locally Decodable Codes for Edit Distance, Perfect minimally adaptive \(q\)-ary search with unreliable tests, Some aspects of the information theoretic dialogue, Least adaptive optimal search with unreliable tests