\(Q\)-ary search with one Lie and bi-interval queries

DOI10.1016/j.ipl.2007.03.003zbMath1185.91021MaRDI QIDQ2379948

Shu Min Xing, Kun Meng, Wen An Liu

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

zbMATH Keywords

fault tolerance; bi-interval queries; worst-case; \(q\)-ary search

Mathematics Subject Classification ID

90B40: Search theory

91A05: 2-person games

Related Items

Minimum number of queries for an adaptive liar search game with small sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ulam's searching game with two lies
• Solution of Ulam's problem on searching with a lie
• Solution of Ulam's problem on binary search with two lies
• Ulam's searching game with lies
• Ulam's searching game with a fixed number of lies
• Solution of Ulam's problem on binary search with three lies
• Optimal comparison strategies in Ulam's searching game with two errors
• Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
• Ulam's searching game with three lies
• Searching with lies
• Optimal strategies against a liar
• Searching for a counterfeit coin with two unreliable weighings
• Searching games with errors -- fifty years of coping with liars