Solution of Ulam's problem on searching with a lie
From MaRDI portal
Publication:1090471
DOI10.1016/0097-3165(87)90065-3zbMath0621.68056OpenAlexW2058515835MaRDI 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
Coding with noiseless feedback ⋮ Strategies for the Renyi--Ulam game with fixed number of lies ⋮ A halfliar's game ⋮ Binary search with errors and variable cost queries ⋮ Complexity of question/answer games ⋮ \(Q\)-ary search with one Lie and bi-interval queries ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Prefix search with a lie ⋮ Three Thresholds for a Liar ⋮ Continuous guessing games with two secret numbers ⋮ Searching with known error probability ⋮ Detecting errors in searching games ⋮ Ulam's searching game with lies ⋮ Optimal comparison strategies in Ulam's searching game with two errors ⋮ The halflie problem. ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Correcting a single error in feedback channels ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Optimal strategies against a liar ⋮ Ulam's searching game with a fixed number of lies ⋮ Solution of Ulam's problem on binary search with three lies ⋮ An algorithm for ``Ulam's Game and its application to error correcting codes ⋮ Finding the maximum and minimum ⋮ Signature codes for noisy multiple access adder channel ⋮ A simple solution to Ulam's liar game with one lie ⋮ Searching with lies: The Ulam problem ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ How to play the one-lie Rényi-Ulam game ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ Two cooperative versions of the guessing secrets problem ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Ulam's searching game with three lies ⋮ Separable collusion-secure multimedia codes ⋮ Ulam's searching game with two lies ⋮ Searching with a forbidden lie pattern in responses ⋮ Group testing with unreliable tests ⋮ Two-batch liar games on a general bounded channel ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ The Interval Liar Game ⋮ Playing by searching: Two strategies against a linearly bounded liar ⋮ An improved heuristic for the ``Ulam-Rényi game ⋮ On error correction with errors in both the channel and syndrome
Cites Work
