Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Combinatorial search
Introduction to algorithms
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Tree algorithms for packet broadcast channels
IEEE Transactions on Information Theory
A perspective on multiaccess channels
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We are given n coins of which k are heavy (defective), while the remaining n - k are light (good). We know both the weight of the good coins and the weight of the defective ones. Therefore, if we weigh a subset Q ⊆ S with a spring scale, then the outcome will tell us exactly the number of defectives contained in Q. The problem, known as Counterfeit Coins problem, is to identify the set of defective coins by minimizing the number of weighings, also called queries. It is well known that Θ(klog k +1(n/k)) queries are enough, even for non-adaptive algorithms, in case k ≤ cn for some constant 0 c A natural interesting generalization arises when we are required to identify any subset of m ≤ k defectives. We show that while for randomized algorithms \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*}\tilde{\Theta}(m)\end{align*} \end{document} **image** queries are sufficient, the deterministic non-adaptive counterpart still requires Θ(klog k +1(n/k)) queries, in case k ≤ n/28; therefore, finding any subset of defectives is not easier than finding all of them by a non-adaptive deterministic algorithm. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 (A preliminary version of this work appeared in Proceedings of the 30th International Conference on Distributed Computing Systems (ICDCS), 2010.)