Binary search with errors and variable cost queries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4033104 (Why is no real title available?)
- scientific article; zbMATH DE number 4049013 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- A combinatorial perspective on the Radon convexity theorem
- A general class of resource tradeoffs
- Binary search with errors and variable cost queries
- Coping with errors in binary search procedures
- Coping with known patterns of lies in a search game
- Prefix search with a lie
- Searching with known error probability
- Solution of Ulam's problem on searching with a lie
- Ulam's searching game with a fixed number of lies
Cited in
(13)- Binary search with delayed and missing answers
- Optimal strategies against a liar
- Searching games with errors -- fifty years of coping with liars
- Memory versus error trade-offs in binary-valued retrieval problems
- Search using queries on indistinguishable items
- Algorithms and Computation
- Searching with known error probability
- Search in an Ordered Array Having Variable Probe Cost
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
- An improved heuristic for the ``Ulam-Rényi game
- Variable continuation in solving a problem in discrete mathematics
- Binary search with errors and variable cost queries
- Coping with errors in binary search procedures (Preliminary Report)
This page was built for publication: Binary search with errors and variable cost queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293463)
