Cites work
- Coping with errors in binary search procedures
- Guess a Number-with Lying
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- Solution of Ulam's problem on binary search with two lies
- Solution of Ulam's problem on searching with a lie
Cited in
(24)- 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
- Group testing with unreliable tests
- Logic of infinite quantum systems
- A nonadaptive version of Ulam's problem with one lie
- Optimal comparison strategies in Ulam's searching game with two errors
- Nonadaptive search problem with sets of equal sum
- Perfect two-fault tolerant search with minimum adaptiveness
- An improved heuristic for the ``Ulam-Rényi game
- Ulam's searching game with three lies
- A problem of minimax estimation with directional information
- Optimal strategies against a liar
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
- \(Q\)-ary search with one Lie and bi-interval queries
- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- Agnostic active learning
- The Algebras of Łukasiewicz Many-Valued Logic: A Historical Overview
- Searching games with errors -- fifty years of coping with liars
- Least adaptive optimal search with unreliable tests
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
- Two cooperative versions of the guessing secrets problem
- Ulam's searching game with two lies
- Searching with a forbidden lie pattern in responses
This page was built for publication: Ulam's searching game with lies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121815)
