Ulam's searching game with three lies
From MaRDI portal
Publication:1802349
Cites work
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- Coping with errors in binary search procedures
- Solution of Ulam's problem on binary search with three lies
- Solution of Ulam's problem on binary search with two lies
- Solution of Ulam's problem on searching with a lie
- Ulam's searching game with lies
- Ulam's searching game with two lies
Cited in
(12)- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- Optimal strategies against a liar
- Searching games with errors -- fifty years of coping with liars
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
- Solution of Ulam's problem on binary search with three lies
- Group testing with unreliable tests
- \(Q\)-ary search with one Lie and bi-interval queries
- Perfect two-fault tolerant search with minimum adaptiveness
- Least adaptive optimal search with unreliable tests
- An improved heuristic for the ``Ulam-Rényi game
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
- Searching for a counterfeit coin with two unreliable weighings
This page was built for publication: Ulam's searching game with three lies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802349)
