Binary search with errors and variable cost queries
From MaRDI portal
Publication:293463
DOI10.1016/S0020-0190(98)00166-5zbMath1339.68063MaRDI QIDQ293463
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001665?np=y
Related Items (5)
Binary search with errors and variable cost queries ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Optimal strategies against a liar ⋮ Searching games with errors -- fifty years of coping with liars ⋮ An improved heuristic for the ``Ulam-Rényi game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary search with errors and variable cost queries
- Coping with known patterns of lies in a search game
- Solution of Ulam's problem on searching with a lie
- Prefix search with a lie
- Searching with known error probability
- Coping with errors in binary search procedures
- Ulam's searching game with a fixed number of lies
- A combinatorial perspective on the Radon convexity theorem
- A general class of resource tradeoffs
This page was built for publication: Binary search with errors and variable cost queries
