Lie patterns in search procedures
Theoretical Computer Science
On selecting the largest element in spite of erroneous information
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory Series A
Search problems
Journal of Combinatorial Theory Series A
Solution of Ulam's problem on binary search with two lies
Journal of Combinatorial Theory Series A
Sorting in c log n parallel steps
Combinatorica
Searching with known error probability
Theoretical Computer Science
Ulam's searching game with lies
Journal of Combinatorial Theory Series A
Detecting errors in searching games
Journal of Combinatorial Theory Series A
Weakly adaptive comparison searching
Theoretical Computer Science
Unbounded searching algorithms
SIAM Journal on Computing
Ulam's searching game with two lies
Journal of Combinatorial Theory Series A
Searching in the presence of linearly bounded errors
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Searching with a forbidden lie pattern in responses
Information Processing Letters
Reliable computation with noisy circuits and decision trees—a general n log n lower bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
Ulam's searching game with a fixed number of lies
Theoretical Computer Science
Solution of Ulam's problem on binary search with three lies
Journal of Combinatorial Theory Series A
Searching with lies: the Ulam problem
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On sorting in the presence of erroneous information
Information Processing Letters
Ulam's searching game with three lies
Advances in Applied Mathematics
Comparison-based search in the presence of errors
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistic diagnosis of multiprocessor systems
ACM Computing Surveys (CSUR)
Searching with local constraints on error patterns
European Journal of Combinatorics
Computing with Noisy Information
SIAM Journal on Computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Surveys in combinatorics, 1995
An algorithm for “Ulam's Game” and its application to error correcting codes
Information Processing Letters
Journal of Combinatorial Theory Series A
Fault-tolerant computer system design
Łukasiewicz normal forms and toric desingularizations
Logic: from foundations to applications
Finding the maximum and minimum
Discrete Applied Mathematics
Group testing with unreliable tests
Information Sciences: an International Journal
Optimal comparison strategies in Ulam's searching game with two errors
Theoretical Computer Science
Binary search with errors and variable cost queries
Information Processing Letters
Information availability vs. solution space size in a knowledge acquisition problem
Computers and Operations Research
Depth optimal sorting networks resistant to k passive faults
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Selection in the presence of noise: the design of playoff systems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On optimal strategies for searching in presence of errors
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Playing twenty questions with a procrastinator
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Conditioning a state by a &Lstroke;ukasiewicz event: a probabilistic approach to Ulam games
Theoretical Computer Science
Optimal strategies against a liar
Theoretical Computer Science
An improved heuristic for the “Ulam-Rényi game”
Information Processing Letters
Regular Article: Perfect Two-Fault Tolerant Search with Minimum Adaptiveness
Advances in Applied Mathematics
Distributed Algorithms
Generalized Kraft's Inequality and Discrete $k$-Modal Search
SIAM Journal on Computing
Playing by searching: two strategies against a linearly bounded liar
Theoretical Computer Science
Reliable Minimum Finding Comparator Networks
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The Complexity of Adaptive Error-Correcting Codes
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE
Binary search with delayed and missing answers
Information Processing Letters
Antirandomizing the Wrong Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Journal of Combinatorial Theory Series A
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Theoretical Computer Science
Strategies for the Renyi-Ulam game with fixed number of lies
Theoretical Computer Science
Theoretical Computer Science - Algorithmic combinatorial game theory
Theoretical Computer Science - Algorithmic combinatorial game theory
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On searching strategies, parallel questions, and delayed answers
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Rounds vs queries trade-off in noisy computation
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The Rényi-Ulam pathological liar game with a fixed number of lies
Journal of Combinatorial Theory Series A
Minimal average cost of searching for a counterfeit coin: restricted model
Discrete Applied Mathematics
Searching for a counterfeit coin with b-balance
Discrete Applied Mathematics
Searching for a counterfeit coin with two unreliable weighings
Discrete Applied Mathematics - Special issue: Max-algebra
Product logic and probabilistic Ulam games
Fuzzy Sets and Systems
Q-ary search with one lie and bi-interval queries
Information Processing Letters
The price of resiliency: a case study on sorting with memory faults
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Searching with lies under error cost constraints
Discrete Applied Mathematics
How to Play the Majority Game with Liars
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Complexity of question/answer games
Theoretical Computer Science
Sorting and Selection with Imprecise Comparisons
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Two batch search with lie cost
IEEE Transactions on Information Theory
Searching for a counterfeit coin with two unreliable weighings
Discrete Applied Mathematics
Finding the maximum and minimum elements with one lie
Discrete Applied Mathematics
Optimal resilient dynamic dictionaries
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Rényi-Ulam game semantics for product logic and for the logic of cancellative hoops
Algebraic and proof-theoretic aspects of non-classical logics
Q-ary Rényi-Ulam pathological liar game with one lie
Discrete Applied Mathematics
Recursive merge sort with erroneous comparisons
Discrete Applied Mathematics
ESA'11 Proceedings of the 19th European conference on Algorithms
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimum average-case queries of q+1-ary search game with small sets
Discrete Applied Mathematics
Experimental study of resilient algorithms and data structures
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Data structures resilient to memory faults: an experimental study of dictionaries
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Optimal resilient sorting and searching in the presence of memory faults
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Minimum and maximum against k lies
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Q-Ary ulam-renyi game with constrained lies
General Theory of Information Transfer and Combinatorics
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An asymptotic solution of dresher's guessing game
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
Designing reliable algorithms in unreliable memories
Computer Science Review
The multi-interval ulam-rényi game
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Hi-index | 5.29 |
This is a survey on searching with errors, considered in the framework of two-person games. The Responder thinks of an object in the search space, and the Questioner has to find it by asking questions to which the Responder provides answers, some of which are erroneous. We give a taxonomy of such games, depending on the type of questions allowed, on the degree of interactivity between the players, and on the imposed limitations on errors. We survey the existing results concerning such games, concentrating on the issue of optimizing the Questioner's querying strategy, and pointing out open problems. We show the relations between searching games with errors and problems concerning communication through a noisy channel and error-correcting codes. Finally, we discuss other search and computation problems with faulty feedback which are related to searching with errors