Ulam's searching game with lies
From MaRDI portal
Publication:1121815
DOI10.1016/0097-3165(89)90062-9zbMATH Open0674.90110OpenAlexW2011308746MaRDI QIDQ1121815FDOQ1121815
Authors: Jurek Czyzowicz, Andrzej Pelc, Daniele Mundici 
Publication date: 1989
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(89)90062-9
Cites Work
Cited In (24)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests
- An improved heuristic for the ``Ulam-Rényi game
- Nonadaptive search problem with sets of equal sum
- Searching games with errors -- fifty years of coping with liars
- Two cooperative versions of the guessing secrets problem
- Ulam's searching game with a fixed number of lies
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
- Group testing with unreliable tests
- Searching with a forbidden lie pattern in responses
- Logic of infinite quantum systems
- Ulam's searching game with two lies
- Searching with lies: The Ulam problem
- Solution of Ulam's problem on binary search with three lies
- The Algebras of Łukasiewicz Many-Valued Logic: A Historical Overview
- A problem of minimax estimation with directional information
- Least adaptive optimal search with unreliable tests
- Ulam's searching game with three lies
- A nonadaptive version of Ulam's problem with one lie
- \(Q\)-ary search with one Lie and bi-interval queries
- Agnostic active learning
- Optimal strategies against a liar
- Optimal comparison strategies in Ulam's searching game with two errors
- 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 lies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121815)
