Overlaps help: Improved bounds for group testing with interval queries
Discrete Applied Mathematics
Coding for a multiple access OR channel: A survey
Discrete Applied Mathematics
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
An efficient FPRAS type group testing procedure to approximate the number of defectives
Journal of Combinatorial Optimization
| Hi-index | 754.84 |
A brief summary of the basic notions of group testing is presented together with a brief historical account. One of the early papers on group testing is shown to include a description of the tree-search polling algorithm of Hayes. The classical group testing problem is formulated, including a criterion for optimality of test plans. A restricted class of tests, called nested testing, is described, and a complete description for an optimal nested strategy is given for both a finite number and an infinite number of Bernoulli distributed random variables. A generalization of group testing applicable to the random access communications problem is presented.