Pages that link to "Item:Q5248479"
From MaRDI portal
The following pages link to Comparison-based search in the presence of errors (Q5248479):
Displaying 18 items.
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Finding the maximum and minimum (Q678861) (← 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)
- On-line learning of rectangles and unions of rectangles (Q1342733) (← 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)
- 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)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Error-Correcting Tournaments (Q3648756) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
