Q-ary search with one Lie and bi-interval queries
From MaRDI portal
Publication:2379948
DOI10.1016/J.IPL.2007.03.003zbMATH Open1185.91021OpenAlexW2048452311MaRDI QIDQ2379948FDOQ2379948
Authors: Wen An Liu, Kun Meng, Shu Min Xing
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.003
Recommendations
Cites Work
- Solution of Ulam's problem on searching with a lie
- Searching with lies
- Ulam's searching game with a fixed number of lies
- Title not available (Why is that?)
- Searching games with errors -- fifty years of coping with liars
- Optimal comparison strategies in Ulam's searching game with two errors
- Title not available (Why is that?)
- Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
- Optimal strategies against a liar
- Searching for a counterfeit coin with two unreliable weighings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ulam's searching game with two lies
- Ulam's searching game with lies
- Solution of Ulam's problem on binary search with two lies
- Solution of Ulam's problem on binary search with three lies
- Ulam's searching game with three lies
Cited In (4)
This page was built for publication: \(Q\)-ary search with one Lie and bi-interval queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379948)