The Counterfeit Coin Problem Revisited

DOI10.1137/0211032zbMath0486.68053OpenAlexW1982866011MaRDI QIDQ3947129

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

Huffman treessearch problemscounterfeit coin problemaverage-optimal algorithmsstraight line algorithm

Mathematics Subject Classification ID

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

Related Items (9)

Optimal detection of a counterfeit coin with multi-arms balances ⋮ A new policy to solve routing conflicts in shuffle-exchange networks ⋮ 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 ⋮ A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Searching for two counterfeit coins with two-arms balance

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