The following pages link to (Q3128931):
Displayed 9 items.
- Sorting and searching in faulty memories (Q1006385) (← links)
- Optimal resilient sorting and searching in the presence of memory faults (Q1035681) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- An improved heuristic for the ``Ulam-Rényi game'' (Q1607032) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design (Q2426665) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)