The following pages link to (Q4763384):
Displayed 12 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Perfect strategies for the Ulam-Rényi game with multi-interval questions (Q489747) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- On-line learning of rectangles and unions of rectangles (Q1342733) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- Drifting games and Brownian motion (Q1604221) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games (Q3556623) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)