Theory Colloquium 2010/2011
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Silvio Micali , CSAIL, MIT
The Second-Knowledge Mechanism
Date: February 1 2011
Time: 4:15PM to 5:15PM
Location: 32-144
Emanuele Viola , Northeastern U.
The Complexity of Distributions
Date: March 1 2011
Time: 4:15PM to 5:15PM
Location: 32-144
Venkatesan Guruswami , Carnegie Mellon U.
Bridging Shannon and Hamming: Codes for computationally simple channels
Date: March 8 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Chris Umans , Caltech
Pseudorandom generators, the BQP vs. PH problem, and beating the hybrid argument
Date: March 15 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Boaz Barak , MSR New England and Princeton U.
Semidefinite Programming Hierarchies and the Unique Games Conjecture
Date: April 26 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Amin Saberi , Stanford U.
A Randomized Rounding Approach to the Traveling Salesman Problem
Date: May 3 2011
Time: 3:45PM to 4:15PM
Location: 32-155
Amin Saberi , Stanford U.
TOC Colloquium
Date: May 3 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Zvika Brakerski , Weizmann Institute of Science and CSAIL, MIT
Efficient Fully Homomorphic Encryption from (Standard) LWE
Date: May 10 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Aaron Roth , MSR New England and UPenn
Privately Releasing Conjunctions and the Statistical Query Barrier
Date: May 17 2011
Time: 4:15PM to 5:15PM
Location: 32-155
Amit Sahai , UCLA
Efficient and Explicit Coding for Interactive Communication
Date: July 22 2011
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil/Kiva
Dana Moshkovitz , CSAIL, MIT
Hardness of Approximately Solving Linear Equations Over Reals
Date: September 7 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Sebastien Roch , UCLA Dept of Math
Phylogeny estimation beyond the classical model of sequence evolution
Date: September 14 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Wojciech Szpankowski , Purdue University
Tries
Date: September 21 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Jonathan Kelner , CSAIL, MIT
Electrical Flows, Laplacian Systems and Faster Approximation of Maximum Flow in Undirected Graphs
Date: September 28 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Allan Sly , Microsoft Research
Correspondence of Computational and Statistical Physics Thresholds
Date: October 5 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Nikhil Bansal , IBM TJ Watson
Constructive Algorithms for Discrepancy Minimization
Date: October 12 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Boaz Patt-Shamir , Tel Aviv University
Algorithmic Recommender Systems
Date: October 19 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Mike Kearns , U Penn
Two Vignettes in Computational Finance
Date: November 2 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Keren Censor-Hillel , MIT
Fast Information Spreading in Graphs with Large Weak Conductance
Date: November 9 2010
Time: 4:15PM to 5:15PM
Location: 32-G144
Amir Shpilka , Technion
Recent Results on Polynomial Identity Testing
Date: November 16 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Ricky Rosen , Weizmann Institute
A Strong Parallel Repetition Theorem for Projection Games on Expanders
Date: November 23 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Ryan Williams , IBM Almaden Research Center
Non-Uniform ACC Circuit Lower Bounds
Date: November 30 2010
Time: 4:15PM to 5:15PM
Location: 32-144
Rafail Ostrovsky , UCLA
Linear-Size Universal Hashing
Date: December 7 2010
Time: 4:15PM to 5:15PM
Location: 32-144
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Back to Previous Series List
Back to Event Calendar
