Solution of Ulam's problem on searching with a lie
From MaRDI portal
Publication:1090471
DOI10.1016/0097-3165(87)90065-3zbMath0621.68056MaRDI QIDQ1090471
Publication date: 1987
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(87)90065-3
Related Items
Three Thresholds for a Liar, Searching games with errors -- fifty years of coping with liars, Least adaptive optimal search with unreliable tests, \(Q\)-ary Rényi-Ulam pathological liar game with one lie, An algorithm for ``Ulam's Game and its application to error correcting codes, Finding the maximum and minimum, Two cooperative versions of the guessing secrets problem, Ulam's searching game with two lies, Searching with a forbidden lie pattern in responses, A simple solution to Ulam's liar game with one lie, How to play the one-lie Rényi-Ulam game, Two-batch liar games on a general bounded channel, Prefix search with a lie, Searching with known error probability, Detecting errors in searching games, Ulam's searching game with lies, 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, Optimal comparison strategies in Ulam's searching game with two errors, The halflie problem., Perfect two-fault tolerant search with minimum adaptiveness, Playing by searching: Two strategies against a linearly bounded liar, An improved heuristic for the ``Ulam-Rényi game, Ulam's searching game with three lies, Strategies for the Renyi--Ulam game with fixed number of lies, A halfliar's game, Optimal strategies against a liar, Complexity of question/answer games, \(Q\)-ary search with one Lie and bi-interval queries, Perfect minimally adaptive \(q\)-ary search with unreliable tests, Searching for a counterfeit coin with two unreliable weighings, The Rényi-Ulam pathological liar game with a fixed number of lies, The Interval Liar Game
Cites Work
