Alexander Gamburd

For his proposed work in expander graphs, highly-connected sparse graphs widely used in Computer Science, in areas ranging from parallel computation to complexity theory and cryptography. His work will further illuminate connections between expander graphs and groups, as well as their applications in number theory (sieving). He plans to develop undergraduate courses in combinatorics and build a Bay Area Consortium in Random Matrix Theory.