Least adaptive optimal search with unreliable tests
From MaRDI portal
Publication:5958337
DOI10.1016/S0304-3975(01)00116-5zbMath0988.68057MaRDI QIDQ5958337
Ferdinando Cicalese, Ugo Vaccaro, Daniele Mundici
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (7)
Strategies for the Renyi--Ulam game with fixed number of lies ⋮ Nonbinary error-correcting codes with one-time error-free feedback ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Searching with lies under error cost constraints ⋮ Searching with lies under error transition cost constraints ⋮ Q-ary Ulam-Rényi game with constrained lies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Solution of Ulam's problem on searching with a lie
- Ulam's searching game with lies
- Weakly adaptive comparison searching
- Ulam's searching game with a fixed number of lies
- Competitive group testing
- Universal code families
- Optimal comparison strategies in Ulam's searching game with two errors
- Perfect two-fault tolerant search with minimum adaptiveness
- Ulam's searching game with three lies
- Searching with lies
- Optimal strategies against a liar
- A new table of constant weight codes
- Three Thresholds for a Liar
- ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
- Comparison-based search in the presence of errors
- Coping with errors in binary search procedures (Preliminary Report)
- On the Nonexistence of Perfect Codes over Finite Fields
- Searching games with errors -- fifty years of coping with liars
This page was built for publication: Least adaptive optimal search with unreliable tests
