CSAIL Event Calendar
Theory Colloquium 2012/2013Tuesdays at 4:15 in 32-155.
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/ Ronald de Wolf, CWI Exponential Lower Bounds for Polytopes in Combinatorial Optimization Date: Thursday, September 6 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Costis Daskalakis, CSAIL, MIT Algorithmic Multidimensional Mechanism Design Date: Tuesday, September 11 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Eric Blais, MIT TOC Colloquium Date: Tuesday, September 18 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Andrew McGregor, UMass Amherst Graph Sketching Date: Tuesday, September 25 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu James Orlin, MIT, Sloan Max flows in O(nm) time, or better Date: Tuesday, October 2 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: *Note*: 32-141 Contact: Be Blackburn, 3-6098, imbe@mit.edu Avi Wigderson, IAS Population Recovery and Partial Identification Date: Wednesday, October 10 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: E25-111 Contact: Be Blackburn, 3-6098, imbe@mit.edu Alon Orlitsky, UCSD Competitive Classification Date: Tuesday, October 16 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: *Note*: 32-141 Contact: Be Blackburn, 3-6098, imbe@mit.edu Irit Dinur, Weizmann and Harvard Covering CSPs Date: Tuesday, October 30 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Prasad Raghavendra, UC Berkeley Polymorphisms and Polynomial-time algorithms. Date: Tuesday, November 6 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Contact: Be Blackburn, 3-6098, imbe@mit.edu Shay Mozes, CSAIL, MIT Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time Date: Tuesday, November 13 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Stata Center Contact: Be Blackburn, 3-6098, imbe@mit.edu Alex Dimakis, USC LIDS/TOC Talk: Coding for Distributed Storage Date: Tuesday, November 27 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: *Note*: 32-141 Contact: Be Blackburn, 3-6098, imbe@mit.edu Piotr Indyk, CSAIL, MIT LIDS/TOC Talk: Faster Algorithms for the Sparse Fourier Transform Date: Tuesday, December 4 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: Note: 32-141 Contact: Be Blackburn, 3-6098, imbe@mit.edu Eli Ben-Sasson, Technion and MIT An additive combinatorics approach relating communication complexity to rank Date: Tuesday, December 11 2012 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-124 Stata Center Contact: Be Blackburn, 3-6098, imbe@mit.edu Noam Nisan, Hebrew University and Microsoft Research Silicon Valley Selling Two Objects (in Three Models) Date: Tuesday, February 5 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in G 5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Ran Canetti, Boston University and Tel Aviv University On extractable functions and other beasts Date: Tuesday, February 12 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in G 5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Greg Valiant, Microsoft Research Finding Correlations, Learning Juntas, and the Closest Pair Problem Date: Tuesday, February 26 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Sebastien Roch, University of Wisconsin-Madison Probabilistic Techniques in Mathematical Phylogenetics: Relating Combinatorial and Variational Distances on Trees* Date: Tuesday, March 5 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Siu On Chan, UC Berkeley APPROXIMATION RESISTANCE FROM PAIRWISE INDEPENDENT SUBGROUPS Date: Tuesday, March 12 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Lorenzo Orecchia, MIT A Nearly-linear-time Spectral Algorithm for Balanced Graph Partitioning Date: Tuesday, March 19 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Thomas Rothvoss, MIT Approximating Bin Packing within O(log OPT * log log OPT) bins Date: Tuesday, April 2 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Valerie King, University of Victoria, BC, Canada Dynamic Graph Connectivity in Polylogarithmic Worst Case Time Date: Tuesday, April 9 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Josh Grochow, University of Toronto Unifying and generalizing known lower bounds via geometric complexity theory Date: Tuesday, April 23 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu Umesh Vazirani, UC Berkeley Note -- Unusual day and time: QUANTUM HAMILTONIAN COMPLEXITY: THROUGH THE COMPUTATIONAL LENS Date: Monday, May 13 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-G882 (Hewlett); refreshments in G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu David P. Woodruff, IBM LOW RANK APPROXIMATION AND REGRESSION IN INPUT SPARSITY TIME* Date: Tuesday, May 14 2013 Time: 4:15PM to 5:15PM Refreshments: 3:45PM Location: 32-141 ; refreshments in RSA G5 lounge Contact: Holly Jones, 617-253-6098, hjones01@mit.edu For more information on this series please see http://theory.csail.mit.edu/toc-seminars/  
|