Fetching the paper…
Reading the bibliography…
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 contain an ill human?".
The detection of defective members of large populations
R. Dorfman · 1943
Earlier work this paper cites.
A comparison of signalling alphabets
E.N. Gilbert · 1952
Earlier work this paper cites.
Estimateof the number of signals in error correcting codes
R.R. Varshamov · 1957
Earlier work this paper cites.
Group testing to eliminate efficiently all defectives in a binomial sample
M. Sobel and P.A. Groll · 1959
Earlier work this paper cites.
A sequential method for screening experimental variables
C.H. Li · 1962
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
Threshold decoding
James L. Massey · 1963
Earlier work this paper cites.
Threshold decoding
J.M. Wozencraft · 1963
Earlier work this paper cites.
Nonrandom binary superimposed codes
W.H. Kautz and R.C. Singleton · 1964
Earlier work this paper cites.
Codes associated with divisors
V.D. Goppa · 1977
Earlier work this paper cites.
Modular curves, Shimura curves, and codes better then the Varshamov-Gilbert bound
M.A. Tsfasman, S.G. Vladut, and T. Zink · 1982
Earlier work this paper cites.
Born again group testing: Multiaccess communications
J.K. Wolf · 1985
Earlier work this paper cites.
Theoretical analysis of library screening using an n- dimensional pooling strategy
E. Barillot, B. Lacroix, and D. Cohen · 1991
Earlier work this paper cites.
Greedy codes
Richard A. Brualdi and Vera Pless · 1993
Earlier work this paper cites.
Towards dna sequencing chips
Pavel A. Pevzner and Robert J. Lipshutz · 1994
Earlier work this paper cites.
Design of efficient pooling experiments
W.J. Bruno, D.J. Balding, E. Knill, D. Bruce, C. Whittaker, N. Dogget, R. Stalling, and D.C. Torney · 1995
Earlier work this paper cites.
Lower bounds for identifying subset members with subset queries
Knill · 1995
Earlier work this paper cites.
A comparative survey of non-adaptive pooling designs
D. J. Balding, W. J. Bruno, E. Knill, and D. C. Torney · 1996
Earlier work this paper cites.
Deterministic restrictions in circuit complexity
Shiva Chaudhuri and Jaikumar Radhakrishnan · 1996
Cited alongside, same era.
The AETG system: An approach to testing based on combinatiorial design
D.M. Cohen, S.R. Dalal, M.L. Fredman, and G.C. Patton · 1997
Cited alongside, same era.
Group testing problems with sequences in experimental molecular biology
M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan · 1997
Cited alongside, same era.
Group testing problems with sequences in experimental molecular biology
M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan · 1997
Cited alongside, same era.
Probabilistic nonadaptive and two-stage group testing with relatively small pools and dna library screening
Macula A.J · 1998
Cited alongside, same era.
Improved algorithms for group testing with inhibitors
Annalisa De Bonis and Ugo Vaccaro · 1998
Pairwise testing
A. Blass and Y. Gurevich · 2002
Later among the works it cites.
Application of cover-free codes and combinatorial designs to two-stage testing
Toby Berger and Vladimir I. Levenshtein · 2003
Later among the works it cites.
Generalized framework for selectors with applications in optimal group testing
A. De Bonis, L. Gasieniec, and U. Vaccaro · 2003
Later among the works it cites.
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels
Annalisa De Bonis and Ugo Vaccaro · 2003
Later among the works it cites.
Distributed broadcast in radio networds of unknown topology
A.E.F. Clementi, A. Monti, and R. Silvestri · 2003
Later among the works it cites.
Optimal two-stage algorithms for group testing problems
Annalisa De Bonis, Leszek Gasieniec, and Ugo Vaccaro · 2005
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Randomized group testing for mutually obscuring defectives
Peter Damaschke · 1998
Cited alongside, same era.
Non-adaptive group testing in the presence of errors
Emanuel Knill, William J. Bruno, and David C. Torney · 1998
Cited alongside, same era.
Fast broadcasting and gossiping in radio networks
Marek Chrobak, Leszek Gasieniec, and Wojciech Rytter · 2000
Cited alongside, same era.
Combinatorial Group Testing and its Applications
D.Z. Du and F.K. Hwang · 2000
Cited alongside, same era.
Group testing for image compression
E.S. Hong and R.E. Ladner · 2000
Cited alongside, same era.
A survey on combinatorial group testing algorithms with applications to DNA library screening
H.Q. Ngo and D.Z. Du · 2000
Cited alongside, same era.
Later among the works it cites.
What’s hot and what’s not: tracking most frequent items dynamically
Graham Cormode and S. Muthukrishnan · 2005
Later among the works it cites.
Algorithmic construction of sets for -restrictions
Noga Alon, Dana Moshkovitz, and Shmuel Safra · 2006
Later among the works it cites.
DIMACS Workshop on Combinatorial Group Testing
The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) · 2006
Later among the works it cites.
Computational Hardness and Explicit Constructions of Error Correcting Codes
Mahdi Cheraghchi, Amin Shokrollahi, and Avi Wigderson · 2006
Later among the works it cites.
Combinatorial algorithms for compressed sensing
Graham Cormode and S. Muthukrishnan · 2006
Later among the works it cites.
Some algorithmic problems and results in compressed sensing
S. Muthukrishnan · 2006
Later among the works it cites.
Deterministic length reduction: Fast convolution in sparse data and applications
Amihood Amir, Oren Kapah, and Ely Porat · 2007
Closest in time.
k k -mismatch with don’t cares
Raphaël Clifford, Klim Efremenko, Ely Porat, and Amir Rothschild · 2007
Closest in time.
One sketch for all: fast algorithms for compressed sensing
A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin · 2007
Closest in time.
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods
M. A. Iwen · 2007
Closest in time.
Explicit constructions for compressed sensing of sparse signals
Piotr Indyk · 2008
Closest in time.