scientific article; zbMATH DE number 782050

zbMATH Open0833.90129MaRDI QIDQ4841306FDOQ4841306

Authors: Raymond Hill 

Publication date: 18 March 1996

Title of this publication is not available (Why is that?)

Recommendations

• Solution of Ulam's problem on binary search with two lies
• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with two lies
• Searching with lies: The Ulam problem
• Optimal strategies against a liar

zbMATH Keywords

liescoding with feedbackUlam's searching problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) 2-person games (91A05)

Cited In (36)

• An improved heuristic for the ``Ulam-Rényi game
• Probabilistic existence theorems in group testing
• An improved upper-bound for Rivest et al.'s half-lie problem
• Search with small sets in presence of a liar
• Searching games with errors -- fifty years of coping with liars
• Title not available (Why is that?)
• Q-ary Ulam-Rényi game with constrained lies
• Truth tellers and liars with fewer questions
• Solution of Ulam's problem on searching with a lie
• Coding Theory Applied to a Problem of Ulam
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
• Beyond knights and knaves
• Searching with a forbidden lie pattern in responses
• Solution of Ulam's problem on binary search with two lies
• In search of the magic lasso: the truth about the polygraph
• Ulam's searching game with two lies
• 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
• Guess a Number-with Lying
• Search when the lie depends on the target
• \(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
• The birthday trick with lies

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)