Algorithms & Randomness Center

Spring 2008, Mondays 3:00 PM in Klaus 1116E unless otherwise indicated.	Previous Colloquia

Feb. 4	Yishay Mansour Tel Aviv University	On a network creation game
Feb. 5	Alexander A. Razborov Steklov Mathematical Institute	Grand Challenges in Complexity Theory
Feb. 11	Eden Chlamtac Princeton University	Coloring, Independent Sets and SDP Hierarchies
Feb. 15	Nina Balcan Carnegie Mellon University	A Theory of Similarity Functions for Learning and Clustering
Feb. 18	Danny Vilinchek Tel Aviv University	On satisfiable k-CNF formulas above the threshold
Mar. 10	Navin Goyal ARC ThinkTank, Georgia Tech	Network design under traffic uncertainty
Mar. 11	Chris Peikert M.I.T.	How to use a short basis: Trapdoors for lattices and new cryptographic constructions
Mar. 12	Howard Karloff AT&T Research Labs, Inc.	Painting Rectilinear Pictures Without Picasso
Mar. 24	Guy Rothblum M.I.T.	Delegating Computation: Interactive Proofs for Muggles
Apr. 14	Anup Rao Institute of Advanced Study	Parallel Repetition in Projection Games and a Concentration Bound
Apr. 26-28	The Lipton Theory Symposium	http://www.cc.gatech.edu/events/lipton-symposium/
April 30	Parikshit Gopalan University of Washington	Agnostically Learning Decision Trees