The Counterfeit Coin Problem Revisited

DOI10.1137/0211032zbMATH Open0486.68053OpenAlexW1982866011MaRDI QIDQ3947129FDOQ3947129

Authors: Nathan Linial, Michael Tarsi 

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211032

zbMATH Keywords

counterfeit coin problemsearch problemsHuffman treesaverage-optimal algorithmsstraight line algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (9)

• Searching for a counterfeit coin with two unreliable weighings
• Searching for a counterfeit coin with \(b\)-balance
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• Optimal detection of two counterfeit coins with two-arms balance.
• Optimal detection of a counterfeit coin with multi-arms balances
• Minimal average cost of searching for a counterfeit coin: restricted model
• Optimal search procedure on coin-weighing problem
• Searching for two counterfeit coins with two-arms balance
• A new policy to solve routing conflicts in shuffle-exchange networks

This page was built for publication: The Counterfeit Coin Problem Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947129)