Solution of Ulam's problem on binary search with three lies

DOI10.1016/0097-3165(92)90107-6zbMath0763.05004OpenAlexW1997792464MaRDI QIDQ1185893

Alberto Negro, Matteo Sereno

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90107-6

zbMATH Keywords

binary searchUlam's problemyes-no queries

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (7)

\(Q\)-ary search with one Lie and bi-interval queries ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ Ulam's searching game with three lies ⋮ Group testing with unreliable tests ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Playing by searching: Two strategies against a linearly bounded liar

Cites Work

• Solution of Ulam's problem on searching with a lie
• Solution of Ulam's problem on binary search with two lies
• Ulam's searching game with lies
• Coping with errors in binary search procedures
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of Ulam's problem on binary search with three lies