scientific article; zbMATH DE number 782050
From MaRDI portal
Publication:4841306
zbMATH Open0833.90129MaRDI QIDQ4841306FDOQ4841306
Publication date: 18 March 1996
Title of this publication is not available (Why is that?)
Cited In (23)
- An improved heuristic for the ``Ulam-Rényi game
- Probabilistic existence theorems in group testing
- Search with small sets in presence of a liar
- Searching games with errors -- fifty years of coping with liars
- Truth tellers and liars with fewer questions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Searching with a forbidden lie pattern in responses
- In search of the magic lasso: the truth about the polygraph
- Searching with lies: The Ulam problem
- Minimum number of queries for an adaptive liar search game with small sets
- A simple solution to Ulam's liar game with one lie
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie
- Least adaptive optimal search with unreliable tests
- Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
- \(Q\)-ary search with one Lie and bi-interval queries
- Ulam's liar problem
- Strategies for the Renyi--Ulam game with fixed number of lies
- 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
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4841306)
