Ulam's searching game with three lies
From MaRDI portal
Publication:1802349
DOI10.1016/0196-8858(92)90019-SzbMATH Open0773.68022MaRDI QIDQ1802349FDOQ1802349
Authors: Alberto Negro, Matteo Sereno 
Publication date: 21 July 1993
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Cites Work
- Solution of Ulam's problem on searching with a lie
- Coping with errors in binary search procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ulam's searching game with two lies
- Ulam's searching game with lies
- Solution of Ulam's problem on binary search with two lies
- Solution of Ulam's problem on binary search with three lies
Cited In (12)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- An improved heuristic for the ``Ulam-Rényi game
- Searching for a counterfeit coin with two unreliable weighings
- Searching games with errors -- fifty years of coping with liars
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
- Group testing with unreliable tests
- Solution of Ulam's problem on binary search with three lies
- Least adaptive optimal search with unreliable tests
- \(Q\)-ary search with one Lie and bi-interval queries
- Optimal strategies against a liar
- Perfect two-fault tolerant search with minimum adaptiveness
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
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)
