Searching for a counterfeit coin with two unreliable weighings
From MaRDI portal
Publication:2565856
DOI10.1016/j.dam.2005.02.015zbMath1071.05003OpenAlexW2017746376MaRDI QIDQ2565856
Wen An Liu, Qi-min Zhang, Zan-Kan Nie
Publication date: 28 September 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.015
Information-theoretic boundsAdaptive searching with unreliable informationWeighing problemWorst-case optimal procedure
Related Items
\(Q\)-ary search with one Lie and bi-interval queries ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized group testing for mutually obscuring defectives
- Finding the maximum and minimum
- Ulam's searching game with two lies
- Two counterfeit coins
- How to find many counterfeit coins?
- Solution of Ulam's problem on searching with a lie
- Five counterfeit coins
- An optimal search procedure
- Solution of Ulam's problem on binary search with three lies
- Search problems for two irregular coins with incomplete feedback: The underweight model
- An improved algorithm for quantitative group testing
- Searching with lies: The Ulam problem
- Group testing with unreliable tests
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- A new competitive algorithm for the counterfeit coin problem
- On the conjecture at two counterfeit coins
- Optimal detection of two counterfeit coins with two-arms balance.
- 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
- Optimal detection of a counterfeit coin with multi-arms balances
- The Counterfeit Coin Problem Revisited
- Optimal Detection of Two Complementary Defectives
- Coin-Weighing Problems
- Search for a majority element
- Searching games with errors -- fifty years of coping with liars
