Derandomization and Group Testing

Derandomization and Group Testing. Cheraghchi, M. In Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, pages 991–997, 2010.

Link

Paper doi abstract bibtex 5 downloads

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.

@INPROCEEDINGS{ref:conf:Che10,
  author =	 {Mahdi Cheraghchi},
  title =	 {Derandomization and Group Testing},
  year =	 2010,
  booktitle =	 {Proceedings of the 48th {Annual Allerton Conference
                  on Communication, Control, and Computing}},
  pages =	 {991--997},
  doi =		 {10.1109/ALLERTON.2010.5707017},
  url_Link =	 {https://ieeexplore.ieee.org/document/5707017},
  url_Paper =	 {https://arxiv.org/abs/1010.0433},
  abstract =	 { 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.  }
}

Downloads: 5