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

DOI10.1016/J.DAM.2006.03.017MaRDI QIDQ2506364zbMATH OpenOpenAlexFDO

Authors Wen An Liu, Hong Yong Ma

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

average costcoin-weighing problemHuffman treesequential algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1375194
• Searching for a counterfeit coin with \(b\)-balance
• Optimal detection of a counterfeit coin with multi-arms balances
• Optimal detection of a number of defective coins
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
• scientific article; zbMATH DE number 1382427
• scientific article; zbMATH DE number 895369
• Non-adaptive solutions to the general counterfeit coin problem
• Optimal detection of two counterfeit coins with two-arms balance.

Cites work

• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
• Coin-Weighing Problems
• Five counterfeit coins
• How to find many counterfeit coins?
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 65702 (Why is no real title available?)
• On separating systems whose elements are sets of at most k elements
• On the conjecture at two counterfeit coins
• Optimal detection of a counterfeit coin with multi-arms balances
• Optimal detection of two counterfeit coins with two-arms balance.
• Optimal search procedure on coin-weighing problem
• Search with small sets in presence of a liar
• Searching for a counterfeit coin with two unreliable weighings
• Searching for counterfeit coins
• Searching for two counterfeit coins with two-arms balance
• Searching games with errors -- fifty years of coping with liars
• The Counterfeit Coin Problem Revisited
• The general counterfeit coin problem
• Two counterfeit coins

Cited in

(4)

• Minimum number of queries for an adaptive liar search game with small sets
• Searching for a counterfeit coin with \(b\)-balance
• Minimum average-case queries of q+1-ary search game with small sets
• The average complexity of a coin-weighing problem

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

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