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 …
Contention resolution with log-logstar channel accesses
For decades, randomized exponential backoff has provided a critical algorithmic building
block in situations where multiple devices seek access to a shared resource. Surprisingly …
block in situations where multiple devices seek access to a shared resource. Surprisingly …
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 …
How to scale exponential backoff: Constant throughput, polylog access attempts, and robustness
Randomized exponential backoff is a widely deployed technique for coordinating access to
a shared resource. A good backoff protocol should, arguably, satisfy three natural …
a shared resource. A good backoff protocol should, arguably, satisfy three natural …
Contention resolution without collision detection
This paper focuses on the contention resolution problem on a shared communication
channel that does not support collision detection. A shared communication channel is a …
channel that does not support collision detection. A shared communication channel is a …
Asynchronous shared channel
G De Marco, G Stachowiak - Proceedings of the ACM Symposium on …, 2017 - dl.acm.org
In this work we address the question whether a simple shared channel could be efficiently
utilized, that is, with a constant throughput and linear packet latency. A shared channel (also …
utilized, that is, with a constant throughput and linear packet latency. A shared channel (also …