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.


Published in:
Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing
Presented at:
48th Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, USA, September 20-October 1, 2010
Year:
2010
Keywords:
Note:
Invited Paper in Proceedings of 48th Annual Allerton Conference on Communication, Control, and Computing, 2010.
Laboratories:




 Record created 2010-10-03, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)