A new competitive algorithm for the counterfeit coin problem

DOI10.1016/0020-0190(94)90122-8zbMath0813.68086OpenAlexW2060109740MaRDI QIDQ1334646

Frank K. Hwang, Pei-de Chen, Xiao-Dong Hu

Publication date: 25 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90122-8

zbMATH Keywords

competitive algorithmcounterfeit

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items

Randomized group testing for mutually obscuring defectives, Coins and cones, A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem, Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem, A 23 log 3-competitive algorithm for the counterfeit coin problem, Searching for counterfeit coins, 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

Cites Work

• Unnamed Item