Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness

DOI10.1002/rsa.20417zbMath1262.68184OpenAlexW1996499471MaRDI QIDQ4903279

Dariusz R. Kowalski, Gianluca De Marco

Publication date: 21 January 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20417

zbMATH Keywords

adaptive algorithmsrandomized algorithmscombinatorial searchcounterfeit coins

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20)

Related Items (6)

Contention resolution in a non-synchronized multiple access channel ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Communication and location discovery in geometric ring networks ⋮ Subquadratic non-adaptive threshold group testing ⋮ Optimal channel utilization with limited feedback ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions

Cites Work

• Forbidding just one intersection
• Resolution of a conflict of known multiplicity
• On \(B_ 2\)-sequences of vectors
• Tree algorithms for packet broadcast channels
• A perspective on multiaccess channels
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Probability and Computing
• Optimal reconstruction of graphs under the additive model
• Unnamed Item
• Unnamed Item

This page was built for publication: Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness