Derandomization and group testing

The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinatorial group testing. In its most basic setting, the aim of group testing is to identify a set of “positive” individuals in a population of items by taking groups of items and asking whether there is a positive in each group. In particular, we will discuss explicit constructions of optimal or nearly-optimal group testing schemes using “randomness-conducting” functions. Among such developments are constructions of error-correcting group testing schemes using randomness extractors and condensers, as well as threshold group testing schemes from lossless condensers.

[1]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.

[2]  Ely Porat,et al.  Search Methodologies , 2022 .

[3]  Omer Reingold,et al.  Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .

[4]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[5]  Enkatesan G Uruswami.  Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .

[6]  D. Du,et al.  Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .

[7]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[8]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[9]  Emanuel Knill,et al.  Lower bounds for identifying subset members with subset queries , 1994, SODA '95.

[10]  Luca Trevisan,et al.  Extractors and pseudorandom generators , 2001, JACM.

[11]  Douglas R. Stinson,et al.  Generalized cover-free families , 2004, Discret. Math..

[12]  Ran Raz,et al.  Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.

[13]  Arkadii G. D'yachkov,et al.  Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others , 2002, J. Comb. Theory, Ser. A.

[14]  GuruswamiVenkatesan,et al.  Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes , 2009 .

[15]  Mahdi Cheraghchi.  Improved Constructions for Non-adaptive Threshold Group Testing , 2010, ICALP.

[16]  Mahdi Cheraghchi,et al.  Noise-resilient group testing: Limitations and constructions , 2008, Discret. Appl. Math..

[17]  Amnon Ta-Shma,et al.  Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.

[18]  Amnon Ta-Shma,et al.  Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..

[19]  Rudolf Ahlswede,et al.  General Theory of Information Transfer and Combinatorics , 2006, GTIT-C.

[20]  Peter Damaschke.  Threshold Group Testing , 2005, Electron. Notes Discret. Math..

[21]  Jaikumar Radhakrishnan,et al.  Tight bounds for depth-two superconcentrators , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[22]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[23]  Luca Trevisan,et al.  Pseudorandomness and Combinatorial Constructions , 2006, Electron. Colloquium Comput. Complex..