Pages that link to "Item:Q1115619"
From MaRDI portal
The following pages link to Searching with known error probability (Q1115619):
Displaying 23 items.
- Binary search with errors and variable cost queries (Q293463) (← links)
- Designing reliable algorithms in unreliable memories (Q458451) (← links)
- Finding the maximum and minimum (Q678861) (← links)
- The Rényi-Ulam games and many-valued logics (Q679806) (← links)
- Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions (Q710617) (← links)
- Ulam's searching game with two lies (Q749204) (← links)
- Searching with a forbidden lie pattern in responses (Q751247) (← links)
- Product logic and probabilistic Ulam games (Q876494) (← links)
- Sorting and searching in faulty memories (Q1006385) (← links)
- The price of resiliency: a case study on sorting with memory faults (Q1016529) (← links)
- On sorting in the presence of erroneous information (Q1199884) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- Efficient broadcasting with linearly bounded faults (Q1281388) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Playing by searching: Two strategies against a linearly bounded liar (Q1603717) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- Three Thresholds for a Liar (Q4291186) (← links)
- A note on broadcasting with linearly bounded transmission faults in constant degree networks (Q5055930) (← links)
- Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation (Q5219733) (← links)
- Rényi-Ulam Game Semantics for Product Logic and for the Logic of Cancellative Hoops (Q5426007) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- External-memory sorting with comparison errors (Q6179436) (← links)
