Harvard/MIT/MSR Reading Group
 |
Laszlo Babai: Graph Isomorphism in Quasipolynomial Time Wednesday, February 3, 2016 - 5:00pm to 8:00pm Abstract: The algorithm indicated in the title builds on Luks's classical framework and introduces new group theoretic and combinatorial tools. |
 |
Gillat Kol: Interactive Compression Friday, December 4, 2015 - 1:30pm to 4:30pm Abstract: In profoundly influential works, Shannon and Huffman showed that if Alice wants to send a message X to Bob, it's sufficient for her to send roughly H(X) bits, where H denotes Shannon's entropy function. This means that |
 |
Philippe Rigollet: Statistical and Computational Tradeoffs in High-Dimensional Learning. Friday, November 13, 2015 - 1:30pm to 4:30pm Abstract: Statistical learning developments are driven by two forces: extracting the most information about the data on the one hand and designing fast algorithms on the other. |
 |
Zrrv Dvir: A Wonderful Theorem of Barthe and its Applications in Discrete Geometry and TCS. Friday, November 6, 2015 - 1:30pm to 4:30pm Abstract: In his work on the Brescamp-Leib inequality, Barthe proved a remarkably simple and useful theorem on finite sets of points in R^d. |
 |
Zeev Dvir: A Wonderful Theorem of Barthe and its Applications in Discrete Geometry and TCS. Friday, November 6, 2015 - 1:30pm to 4:30pm Abstract: In his work on the Brescamp-Leib inequality, Barthe proved a remarkably simple and useful theorem on finite sets of points in R^d. |
 |
Rüdiger Urbanke: EXIT Functions and the Area Theorem in Coding Theory Friday, October 30, 2015 - 1:30pm to 4:30pm Abstract: An EXIT function measures the ``response’’ of a code to |
 |
Bobby Kleinberg: Inference-Based Privacy Guarantees for Differentially Private Mechanisms, or The Physics of Differential Privacy Friday, March 4, 2016 - 1:30pm to 4:30pm ABSTRACT: How much information can an attacker learn about an individual by observing the outcome of a computation? |
Pages
