Binary search with errors and variable cost queries
From MaRDI portal
Publication:293463
DOI10.1016/S0020-0190(98)00166-5zbMATH Open1339.68063MaRDI QIDQ293463FDOQ293463
Authors: Matteo Sereno 
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
Recommendations
Cites Work
- Solution of Ulam's problem on searching with a lie
- Coping with errors in binary search procedures
- A combinatorial perspective on the Radon convexity theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prefix search with a lie
- Searching with known error probability
- Ulam's searching game with a fixed number of lies
- A general class of resource tradeoffs
- Binary search with errors and variable cost queries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coping with known patterns of lies in a search game
Cited In (13)
- An improved heuristic for the ``Ulam-Rényi game
- Searching games with errors -- fifty years of coping with liars
- Algorithms and Computation
- Binary search with errors and variable cost queries
- Search in an Ordered Array Having Variable Probe Cost
- Variable continuation in solving a problem in discrete mathematics
- Binary search with delayed and missing answers
- Search using queries on indistinguishable items
- Searching with known error probability
- Coping with errors in binary search procedures (Preliminary Report)
- Memory versus error trade-offs in binary-valued retrieval problems
- Optimal strategies against a liar
- Perfect strategies for the Ulam-Rényi game with multi-interval questions
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)
