*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Algorithms & Randomness Center (ARC)
Amin Coja-Oghlan (Goethe University, Frankfurt)
Monday, April 12, 2021
Virtual via Bluejeans - 11:00 am
Title: Group Testing
Abstract: In the group testing problem the goal is to identify a small number of infected individuals within a large population by conducting as small a number of tests as possible. The tests are assumed to accept pools of individuals rather than just single individuals, with a test returning a positive result iff at least one individual in the pool is actually infected. Mathematically we ask for information-theoretic lower bounds showing that a certain number of tests is necessary to correctly learn the set of infected individuals as well as algorithmic upper bounds showing that a certain number of tests suffice. In this talk I am going to present some mathematical results, some experimental results and some open problems.
----------------------------------
Videos of recent talks are available at: http://arc.gatech.edu/node/121
Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu
