Minimal average cost of searching for a counterfeit coin: restricted model

DOI10.1016/j.dam.2006.03.017zbMath1180.68307OpenAlexW2049579614MaRDI QIDQ2506364

Hong Yong Ma, Wen An Liu

Publication date: 28 September 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.017

zbMATH Keywords

sequential algorithmaverage costHuffman treecoin-weighing problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Enumerative combinatorics (05A99)

Related Items (2)

Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Minimum number of queries for an adaptive liar search game with small sets

Cites Work

• Unnamed Item
• Unnamed Item
• Searching for counterfeit coins
• On separating systems whose elements are sets of at most k elements
• Two counterfeit coins
• How to find many counterfeit coins?
• Five counterfeit coins
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• On the conjecture at two counterfeit coins
• Optimal detection of two counterfeit coins with two-arms balance.
• Optimal detection of a counterfeit coin with multi-arms balances
• The general counterfeit coin problem
• Optimal search procedure on coin-weighing problem
• Searching for a counterfeit coin with two unreliable weighings
• Searching for two counterfeit coins with two-arms balance
• The Counterfeit Coin Problem Revisited
• Coin-Weighing Problems
• Search with small sets in presence of a liar
• Searching games with errors -- fifty years of coping with liars

This page was built for publication: Minimal average cost of searching for a counterfeit coin: restricted model