Abstract

What makes sublinear algorithms so fast? Lecture II

Anna Gilbert
University of Michigan
Mathematics

Lecture 2: Combinatorial group testing and coding theory
a. Definition of CGT
b. Basic testing designs and bounds
c. Coding theory and pseudo-random variables

Back to Short Course: Sparse Representations and High Dimensional Geometry : In conjunction with the AMS 2007 Von Neumann Symposium