CSAIL Event Calendar
Theory Colloquium 2011/2012Tuesdays at 4:15 in 32-155.
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/ Andrew Lo, CSAIL, MIT The Origin of Behavior Date: Tuesday, September 13 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn , 3-6098, imbe@mit.edu Oded Goldreich, Weizmann Institute of Science, Israel A Property Testing Double-Feature of Short Talks Date: Tuesday, September 20 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn , 3-6098, imbe@mit.edu Scott Aaronson, CS The Complexity of Linear Optics Date: Tuesday, October 4 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Yury Polyanskiy, LIDS, MIT Optimal channel codes and concentration of measure Date: Monday, October 17 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: ** 32-144 ** JUST this time Contact: Be Blackburn, 3-6098, imbe@mit.edu Lap Chi Lau, The Chinese University of Hong Kong Graph Connectivity, Network Coding, Expander Graph, and Matrix Rank. Date: Thursday, October 27 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-G449 Patil/Kiva Contact: Be Blackburn, 3-6098, imbe@mit.edu Devavrat Shah , LIDS, MIT Rumor in a network: who's the culprit ? Date: Thursday, November 3 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: ** 32-D463 ** this time only Contact: Be Blackburn, 3-6098, be@csail.mit.edu Yury Makarychev, TTI, U Chicago The Grothendieck constant is strictly smaller than Krivine Date: Tuesday, November 8 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, be@csail.mit.edu Santosh Vempala, Georgia Tech Many Sparse Cuts via Higher Eigenvalues Date: Tuesday, November 15 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, be@csail.mit.edu Aleksander Madry, Microsoft Research-New England Online Algorithms and the k-server Conjecture Date: Tuesday, November 22 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Brendan Lucier, Microsoft Research, NE The Limits of Black-Box Transformations in Mechanism Design Date: Tuesday, November 29 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45AM Location: 32-124 Contact: Be Blackburn, 3-6098, be@csail.mit.edu Jon Kleinberg, Cornell U. Network Formation in the Presence of Contagious Risk Date: Tuesday, December 6 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, be@csail.mit.edu Huijia (Rachel) Lin, EECS, MIT Concurrent Security Date: Tuesday, December 13 2011 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Virginia Vassilevska Williams, UC Berkeley and Stanford U Multiplying matrices faster than Coppersmith-Winograd Date: Tuesday, February 7 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, be@csail.mit.edu Silvio Micali, CSAIL, MIT Knightian Auctions Date: Tuesday, February 14 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Thomas Vidick, CSAIL, MIT Certifiable Quantum Dice Date: Tuesday, February 21 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Ilias Diakonikolas, UC Berkeley A nearly optimal solution for the Chow Parameters Problem and applications Date: Tuesday, February 28 2012 Time: 5:15PM to 6:15PM Refreshments: 4:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Julia Chuzhoy, Toyota Technological Institute, Chicago Routing in Undirected Graphs with Constant Congestion Date: Tuesday, March 6 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Mihalis Yannakakis, Columbia University Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars Date: Tuesday, March 13 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Shafi Goldwasser, CSAIL, MIT Pseudo Deterministic Algorithms Date: Tuesday, March 20 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Dana Ron, Tel-Aviv University On sublinear algorithms for approximating graph parameters Date: Tuesday, April 10 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Tim Roughgarden , Stanford University An Extension Theorem for the Price of Anarchy in Games of Incomplete Information Date: Tuesday, April 24 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Jake Abernethy, U Penn Minimax Option Pricing Meets Black-Scholes in the Limit Date: Tuesday, May 1 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Irit Dinur, Weizmann Institute Talk CANCELLED - but come for snacks! Date: Tuesday, May 8 2012 Refreshments: 3:45PM Location: 32-G5th floor RSA lounge Contact: Be Blackburn, 3-6098, imbe@mit.edu Yael Tauman Kalai, Microsoft S.R. Efficient Interactive Coding Against Adversarial Noise. Date: Tuesday, May 15 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-155 Contact: Be Blackburn, 3-6098, imbe@mit.edu Christos Papadimitriou, UC Berkeley Public Lecture Date: Friday, May 18 2012 Time: 1:00PM to 2:00PM Location: Stata - Sem Rm D463 (Star) Benny Shilo, Weizmann Institute Egg to organism: Visualizing the concepts of development Date: Wednesday, May 30 2012 Time: 12:00PM to 1:00PM Refreshments: 11:45AM Location: Hewlett Room, 32-G882, Stata Center, MIT Contact: Be Blackburn, 3-6098, imbe@mit.edu For more information on this series please see http://theory.csail.mit.edu/toc-seminars/  
|