A new competitive algorithm for the counterfeit coin problem

DOI10.1016/0020-0190(94)90122-8MaRDI QIDQ1334646zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang, Xiaodong Hu, Pei-de Chen

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)

Recommendations

• A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
• scientific article; zbMATH DE number 895369
• scientific article; zbMATH DE number 1159036

Cited in

(14)

• Fast simulation of new coins from old
• A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
• Searching for a counterfeit coin with two unreliable weighings
• On Detecting Fake Coin Flip Sequences
• Some new results concerning three counterfeit coins problem
• Randomized group testing for mutually obscuring defectives
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
• Optimal search procedure on coin-weighing problem
• Searching for two counterfeit coins with two-arms balance
• 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
• Searching for counterfeit coins
• A 23 log 3-competitive algorithm for the counterfeit coin problem

This page was built for publication: A new competitive algorithm for the counterfeit coin problem

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