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 …

We develop a new algorithm for the turnstile heavy hitters problem in general turnstile
streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of …

We consider the nonadaptive group testing with N items, of which K= Θ (N θ) are defective.
We study a test design in which each item appears in nearly the same number of tests. For …

Group testing is the problem of identifying K defective items among n items by pooling
groups of items. In this paper, we design group testing algorithms for approximate recovery …

Existing proofs that deduce BPP= P from circuit lower bounds convert randomized
algorithms into deterministic algorithms with a large polynomial slowdown. We convert …

We consider the probabilistic group testing problem where d random defective items in a
large population of N items are identified with high probability by applying binary tests. It is …

Abstract A (d, ℓ)-list disjunct matrix is a non-adaptive group testing primitive which, given a
set of items with at most d “defectives,” outputs a superset of the defectives containing less …

Group-testing refers to the problem of identifying (with high probability) a (small) subset of D
defectives from a (large) set of N items via a “small” number of “pooled” tests (ie, tests that …

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 …

In the long-studied problem of combinatorial group testing, one is asked to detect a set of k
defective items out of a population of size n, using m≪ n disjunctive measurements. In the …