Home /  Workshop /  Schedule

Schedule, Notes/Handouts & Videos

Quantitative Geometry in Computer Science December 05, 2011 - December 09, 2011

Show All Collapse
Dec 05, 2011
Monday
09:00 AM - 09:30 AM
  Welcome
09:30 AM - 10:30 AM
  Tutorial I - Nikhil Srivastava
10:30 AM - 11:00 AM
  Tea
11:00 AM - 12:00 PM
  Estimation of Small Norms in Data Streams
Jelani Nelson (Harvard University)
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  Electrical Flows, Laplacian Systems and Faster Approximation of Maximum Flow in Undirected Graphs
Jonathan Kelner
03:00 PM - 03:30 PM
  Tea
03:30 PM - 04:20 PM
  Multi-Way Spectral Partitioning and Higher-Order Cheeger Inequalities
James Lee
Dec 06, 2011
Tuesday
09:30 AM - 10:30 AM
  Tutorial II - Nikhil Srivastava
10:30 AM - 11:00 AM
  Tea
11:00 AM - 12:00 PM
  A Nearly Optimal Solution for the Chow Parameters Problem and Applications
Ilias Diakonikolas
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  Recent Developments in Learning Convex Sets
Adam Klivans
03:00 PM - 03:30 PM
  Tea
03:30 PM - 04:30 PM
  Gaussian Noise Sensitivity
Ryan O'Donnell (Carnegie Mellon University)
04:30 PM - 06:30 PM
  Welcome Reception
Dec 07, 2011
Wednesday
09:30 AM - 10:20 AM
  Tutorial III - Nikhil Srivastava
10:20 AM - 10:50 AM
  Tea
10:50 AM - 11:40 AM
  Information Theoretic Techniques in Theoretical Computer Science I
Oded Regev (New York University, Courant Institute)
11:40 AM - 12:40 PM
  Incidence Geometry and Applications in Theoretical Computer Science
Shubhangi Saraf
12:40 PM - 02:40 PM
  Lunch
Dec 08, 2011
Thursday
09:30 AM - 10:20 AM
  Information Theoretic Techniques in Theoretical Computer Science II
Oded Regev (New York University, Courant Institute)
10:20 AM - 10:50 AM
  Tea
10:50 AM - 11:45 AM
  Nearest Neighbor Search and Metric Expansion
Kunal Talwar
11:45 AM - 12:45 PM
  A New Infinity of Distance Oracles for Sparse Graphs
Mihai Patrascu
12:45 PM - 02:30 PM
  Lunch
02:30 PM - 03:30 PM
  A Deterministic Algorithm for Matrix Completion - Adi Shraibman
03:30 PM - 04:00 PM
  Tea
04:00 PM - 04:50 PM
  Algorithmic Applications of M-Ellipsoids
Santosh Vempala (Georgia Institute of Technology)
Dec 09, 2011
Friday
09:30 AM - 10:30 AM
  Information Theoretic Techniques in Theoretical Computer Science III
Oded Regev (New York University, Courant Institute)
10:30 AM - 11:00 AM
  Tea
11:00 AM - 12:00 PM
  Tight Bounds for Distributed Functional Monitoring - David Woodruff
12:00 PM - 01:00 PM
  Remarks on Coresets for Minimum Enclosing Ellipsoids - Ken Clarkson
01:00 PM - 03:00 PM
  Lunch
Back to Workshop