Pages that link to "Item:Q1144379"
From MaRDI portal
The following pages link to Coping with errors in binary search procedures (Q1144379):
Displaying 42 items.
- On error correction with errors in both the channel and syndrome (Q259902) (← links)
- Binary search with errors and variable cost queries (Q293463) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions (Q489747) (← links)
- An algorithm for ``Ulam's Game'' and its application to error correcting codes (Q671940) (← links)
- Finding the maximum and minimum (Q678861) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Coping with known patterns of lies in a search game (Q797505) (← links)
- A simple solution to Ulam's liar game with one lie (Q952012) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- A survey of information-based complexity (Q1080661) (← links)
- Lie patterns in search procedures (Q1090470) (← links)
- Solution of Ulam's problem on searching with a lie (Q1090471) (← links)
- Prefix search with a lie (Q1102755) (← links)
- Searching with known error probability (Q1115619) (← links)
- Detecting errors in searching games (Q1119495) (← links)
- Ulam's searching game with lies (Q1121815) (← links)
- Coping with errors in binary search procedures (Q1144379) (← links)
- Ulam's searching game with a fixed number of lies (Q1184984) (← links)
- Solution of Ulam's problem on binary search with three lies (Q1185893) (← links)
- Searching with lies: The Ulam problem (Q1199612) (← links)
- On sorting in the presence of erroneous information (Q1199884) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Ulam's searching game with three lies (Q1802349) (← links)
- On the complexity of function learning (Q1900975) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Continuous guessing games with two secret numbers (Q2163441) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- (Q5075792) (← links)
- On the Rényi-Ulam game with restricted size queries (Q6108923) (← links)
- Correcting a single error in feedback channels (Q6173470) (← links)
- Contract scheduling with predictions (Q6488786) (← links)
