Coping with errors in binary search procedures
From MaRDI portal
Publication:1144379
DOI10.1016/0022-0000(80)90014-8zbMath0443.68043WikidataQ59701061 ScholiaQ59701061MaRDI QIDQ1144379
Ronald L. Rivest, Klaus Winkelmann, Daniel J. Kleitman, J. H. Spencer, Albert R. Meyer
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90014-8
Related Items
Three Thresholds for a Liar, Unnamed Item, An algorithm for ``Ulam's Game and its application to error correcting codes, Finding the maximum and minimum, Ulam's searching game with a fixed number of lies, Solution of Ulam's problem on binary search with three lies, Searching with lies: The Ulam problem, On sorting in the presence of erroneous information, Group testing with unreliable tests, Search problems: One, two or many rounds, Perfect two-fault tolerant search with minimum adaptiveness, Ulam's searching game with three lies, On the complexity of function learning, Optimal strategies against a liar