Coping with errors in binary search procedures
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 3431965 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback
- Coping with errors in binary search procedures
Cited in
(51)- Dealing with liars: misbehavior identification via Rényi-Ulam games
- On error correction with errors in both the channel and syndrome
- An improved heuristic for the ``Ulam-Rényi game
- The infinite duration lying oracle game
- Detecting errors in searching games
- An efficient noisy binary search in graphs via Median approximation
- The entropy of lies: playing twenty questions with a liar
- Searching games with errors -- fifty years of coping with liars
- Solution of Ulam's problem on searching with a lie
- Coping with errors in binary search procedures
- An algorithm for ``Ulam's Game and its application to error correcting codes
- Binary search with errors and variable cost queries
- A path guessing game with wagering
- Optimal sorting with persistent comparison errors
- On the complexity of function learning
- Coping with known patterns of lies in a search game
- Exact learning from an honest teacher that answers membership queries
- Ulam's searching game with lies
- Designing reliable algorithms in unreliable memories
- Prefix search with a lie
- Searching with known error probability
- Ulam's searching game with a fixed number of lies
- Three Thresholds for a Liar
- Group testing with unreliable tests
- Searching with a forbidden lie pattern in responses
- Continuous guessing games with two secret numbers
- Reliable minimum finding comparator networks
- Lie patterns in search procedures
- Ulam's searching game with two lies
- Searching with lies: The Ulam problem
- Solution of Ulam's problem on binary search with three lies
- A simple solution to Ulam's liar game with one lie
- Operations research applications of dichotomous search
- The lying oracle game with a biased coin
- Contract scheduling with predictions
- Correcting a single error in feedback channels
- Search problems: One, two or many rounds
- Approximate minimum selection with unreliable comparisons
- Ulam's searching game with three lies
- scientific article; zbMATH DE number 1369845 (Why is no real title available?)
- Sorting and searching in faulty memories
- On sorting in the presence of erroneous information
- Optimal strategies against a liar
- A survey of information-based complexity
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
- Perfect two-fault tolerant search with minimum adaptiveness
- Playing by searching: Two strategies against a linearly bounded liar
- The price of resiliency: a case study on sorting with memory faults
- Finding the maximum and minimum
- Optimal resilient sorting and searching in the presence of memory faults
- On the Rényi-Ulam game with restricted size queries
This page was built for publication: Coping with errors in binary search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144379)
