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 …
Signature schemes with bounded leakage resilience
J Katz, V Vaikuntanathan - International Conference on the Theory and …, 2009 - Springer
A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information
about the secret key (and possibly other internal state information) is leaked to an adversary …
about the secret key (and possibly other internal state information) is leaked to an adversary …
Using viral load and epidemic dynamics to optimize pooled testing in resource-constrained settings
Virological testing is central to severe acute respiratory syndrome coronavirus 2 (SARS-CoV-
2) containment, but many settings face severe limitations on testing. Group testing offers a …
2) containment, but many settings face severe limitations on testing. Group testing offers a …
Efficiently decodable non-adaptive group testing
We consider the following “efficiently decodable” non-adaptive group testing problem. There
is an unknown string x∊{0, 1} n with at most d ones in it. We are allowed to test any subset …
is an unknown string x∊{0, 1} n with at most d ones in it. We are allowed to test any subset …
Group testing and sparse signal recovery
AC Gilbert, MA Iwen, MJ Strauss - 2008 42nd Asilomar …, 2008 - ieeexplore.ieee.org
Traditionally, group testing is a design problem. The goal is to design an optimally efficient
set of tests of items such that the test results contain enough information to determine a small …
set of tests of items such that the test results contain enough information to determine a small …
Explicit non-adaptive combinatorial group testing schemes
E Porat, A Rothschild - International Colloquium on Automata, Languages …, 2008 - Springer
Group testing is a long studied problem in combinatorics: A small set of r ill people should be
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
On the optimality of the Kautz-Singleton construction in probabilistic group testing
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 …
large population of N items are identified with high probability by applying binary tests. It is …
Efficiently decodable error-correcting list disjunct matrices and applications
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 …
set of items with at most d “defectives,” outputs a superset of the defectives containing less …
Efficient algorithms for noisy group testing
S Cai, M Jahangoshahi, M Bakshi… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
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 …
defectives from a (large) set of N items via a “small” number of “pooled” tests (ie, tests that …
[图书][B] Fault-Tolerant Search Algorithms
F Cicalese - 2013 - Springer
The study of the effect that errors may have on computation started at the very beginning of
the history of computer science. It dates back to the early 1950s, to the research by von …
the history of computer science. It dates back to the early 1950s, to the research by von …