A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
From MaRDI portal
Publication:1270819
DOI10.1016/S0166-218X(98)00025-0zbMath0906.68050MaRDI QIDQ1270819
Publication date: 13 December 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Searching and sorting (68P10) Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10)
Related Items (8)
Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Optimal detection of two counterfeit coins with two-arms balance. ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance ⋮ Optimal search procedure on coin-weighing problem ⋮ Disjoint Spread Systems and Fault Location ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Searching for two counterfeit coins with two-arms balance
Cites Work
- How to find many counterfeit coins?
- The complexity of parallel search
- Search problems for two irregular coins with incomplete feedback: The underweight model
- An improved algorithm for quantitative group testing
- Optimal detection of a counterfeit coin with multi-arms balances
- The average number of weighings to locate a counterfeit coin (Corresp.)
- On various versions of the defective coin problem
- Detection of a Defective Coin with Partial Weight Information
- Optimal Detection of Two Defectives with a Parity Check Device
- Searching for Two Objects by Underweight Feedback
- An improved strategy for a counterfeit coin problem (Corresp.)
- The Counterfeit Coin Problem Revisited
- Coin-Weighing Problems
- A Method for the Construction of Minimum-Redundancy Codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
