Group Testing, Compressed sensing and Algorithmic applications

EADS talk by Ely Porat

Title: Group Testing, Compressed sensing and Algorithmic applications

Abstract: Group testing is a long studied problem in combinatorics: A small set of r ill people must be identified out of the whole population of n people, by using only queries (tests) of the form “Does set X contain an ill member?”.  I will discuss the current state of the art, and show several surprising applications for group testing techniques.

About the speaker

Ely Porat has been an Associate Professor in the Department of Computer Science at Bar-Ilan University, Israel, since 2007. 

His main research interests include:

Data Structures
Streaming Algorithms
Pattern Matching
Coding Theory
Compress Sensing