Group testing: an information theory perspective
The group testing problem concerns discovering a small number of defective items within a
large population by performing tests on pools of items. A test is positive if the pool contains …
large population by performing tests on pools of items. A test is positive if the pool contains …
More applications of the polynomial method to algorithm design
In low-depth circuit complexity, the polynomial method is a way to prove lower bounds by
translating weak circuits into low-degree polynomials, then analyzing properties of these …
translating weak circuits into low-degree polynomials, then analyzing properties of these …
Phase transitions in group testing
J Scarlett, V Cevher - Proceedings of the twenty-seventh annual ACM-SIAM …, 2016 - SIAM
The group testing problem consists of determining a sparse subset of a set of items that are
“defective” based on a set of possibly noisy tests, and arises in areas such as medical …
“defective” based on a set of possibly noisy tests, and arises in areas such as medical …
Noisy adaptive group testing: Bounds and algorithms
J Scarlett - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
The group testing problem consists of determining a small set of defective items from a
larger set of items based on a number of possibly noisy tests, and is relevant in applications …
larger set of items based on a number of possibly noisy tests, and is relevant in applications …
Noisy non-adaptive group testing: A (near-) definite defectives approach
J Scarlett, O Johnson - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
The group testing problem consists of determining a small set of defective items from a
larger set of items based on a number of possibly-noisy tests, and is relevant in applications …
larger set of items based on a number of possibly-noisy tests, and is relevant in applications …
A fast binary splitting approach to non-adaptive group testing
E Price, J Scarlett - arXiv preprint arXiv:2006.10268, 2020 - arxiv.org
In this paper, we consider the problem of noiseless non-adaptive group testing under the for-
each recovery guarantee, also known as probabilistic group testing. In the case of $ n …
each recovery guarantee, also known as probabilistic group testing. In the case of $ n …
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding
The group testing problem consists of determining a small set of defective items from a
larger set of items based on tests on groups of items, and is relevant in applications such as …
larger set of items based on tests on groups of items, and is relevant in applications such as …
Noisy adaptive group testing using Bayesian sequential experimental design
When the infection prevalence of a disease is low, Dorfman showed 80 years ago that
testing groups of people can prove more efficient than testing people individually. Our goal …
testing groups of people can prove more efficient than testing people individually. Our goal …
Near-optimal noisy group testing via separate decoding of items
J Scarlett, V Cevher - IEEE Journal of Selected Topics in Signal …, 2018 - ieeexplore.ieee.org
The group testing problem consists of determining a small set of defective items from a
larger set of items based on a number of tests, and is relevant in applications such as …
larger set of items based on a number of tests, and is relevant in applications such as …
Group testing on general set-systems
M Gonen, M Langberg… - 2022 IEEE International …, 2022 - ieeexplore.ieee.org
Group testing is one of the fundamental problems in coding theory and combinatorics in
which one is to identify a subset of contaminated items from a given ground set. There has …
which one is to identify a subset of contaminated items from a given ground set. There has …