Site Search
Quantitative Geometry in Computer Science
Dec 5, 2011 to Dec 9, 2011

Organizer(s)

Irit Dinur (Weizmann Institute), Subhash Khot (Courant Institute), Manor Mendel* (Open University of Israel and Microsoft Research), Assaf Naor (Courant Institute), and Alistair Sinclair (University of California, Berkeley)
Geometric problems which are inherently quantitative occur in various aspects of theoretical computer science, including
a)      Algorithmic tasks for geometric questions such as clustering and proximity data structures.
b)      Geometric methods in the design of approximation algorithms for combinatorial optimization problems, including the analysis of semidefinite programs and embedding methods.
c)       Geometric questions arising from computational complexity, particularly in hardness of approximation. These include isoperimetric and Fourier analytic problems. These include isoperimetric and Fourier analytic problems.

This workshops aims to present recent progress in these directions.

Bibliography (PDF)

Accommodation:
A block of rooms has been reserved at the Rose Garden Inn. Reservations may be made by calling 1-800-992-9005 OR directly on their website. Click on Corporate at the bottom of the screen and when prompted enter code MATH (this code is not case sensitive). By using this code a new calendar will appear and will show MSRI rate on all room types available.

A block of rooms has been reserved at the Hotel Durant. Please mention MSRI and the workshop name when making reservations via phone, fax or e-mail. If you are making your reservations on line, please go to Hotel Durant website, choose your dates of stay and enter the "123MSRI" promo code in the box. The cut-off date for reservations is Midnight on the day of Tuesday, November 8, 2011. The rate is $110 per night plus tax.

MSRI has a preferred rate of $135 at the Hotel Shattuck Plaza, depending on room availability. Guests can either call the hotel's main line at 510-845-7300 and ask for the MSRI rate; or go to Hotel Shattuck Plaza and enter dates of stay at top of screen and click Book Now.  Once on the reservation page, click Preferred/Corporate Rate Accounts and input the code "MSRI11".

Schedule
Monday, December 05, 2011
9:00AM - 9:30AM MSRI, Simons Auditorium Welcome
9:30AM - 10:30AM MSRI, Simons Auditorium Tutorial I - Nikhil Srivastava [Video available]
10:30AM - 11:00AM MSRI, Atrium Tea
11:00AM - 12:00PM MSRI, Simons Auditorium Jelani Nelson Estimation of Small Norms in Data Streams ( Abstract ) [Video available]
12:00PM - 2:00PM MSRI, Atrium Lunch
2:00PM - 3:00PM MSRI, Simons Auditorium Jonathan Kelner Electrical Flows, Laplacian Systems and Faster Approximation of Maximum Flow in Undirected Graphs ( Abstract ) [Video available]
3:00PM - 3:30PM MSRI, Atrium Tea
3:30PM - 4:20PM MSRI, Simons Auditorium James Lee Multi-Way Spectral Partitioning and Higher-Order Cheeger Inequalities ( Abstract ) [Video available]
Tuesday, December 06, 2011
9:30AM - 10:30AM MSRI, Simons Auditorium Tutorial II - Nikhil Srivastava [Video available]
10:30AM - 11:00AM MSRI, Atrium Tea
11:00AM - 12:00PM MSRI, Simons Auditorium Ilias Diakonikolas A Nearly Optimal Solution for the Chow Parameters Problem and Applications ( Abstract ) [Video available]
12:00PM - 2:00PM MSRI, Atrium Lunch
2:00PM - 3:00PM MSRI, Simons Auditorium Adam Klivans Recent Developments in Learning Convex Sets ( Abstract ) [Video available]
3:00PM - 3:30PM MSRI, Atrium Tea
3:30PM - 4:30PM MSRI, Simons Auditorium Ryan O\'Donnell Gaussian Noise Sensitivity [Video available]
4:30PM - 6:30PM MSRI, Atrium Welcome Reception
Wednesday, December 07, 2011
9:30AM - 10:20AM MSRI, Simons Auditorium Tutorial III - Nikhil Srivastava [Video available]
10:20AM - 10:50AM MSRI, Atrium Tea
10:50AM - 11:40AM MSRI, Simons Auditorium Oded Regev Information Theoretic Techniques in Theoretical Computer Science I ( Abstract ) [Video available]
11:40AM - 12:40PM MSRI, Simons Auditorium Shubhangi Saraf Incidence Geometry and Applications in Theoretical Computer Science ( Abstract ) [Video available]
12:40PM - 2:40PM MSRI, Atrium Lunch
Thursday, December 08, 2011
9:30AM - 10:20AM MSRI, Simons Auditorium Oded Regev Information Theoretic Techniques in Theoretical Computer Science II ( Abstract ) [Video available]
10:20AM - 10:50AM MSRI, Atrium Tea
10:50AM - 11:45AM MSRI, Simons Auditorium Kunal Talwar Nearest Neighbor Search and Metric Expansion ( Abstract ) [Video available]
11:45AM - 12:45PM MSRI, Simons Auditorium Mihai Patrascu A New Infinity of Distance Oracles for Sparse Graphs ( Abstract ) [Video available]
12:45PM - 2:30PM MSRI, Atrium Lunch
2:30PM - 3:30PM MSRI, Simons Auditorium A Deterministic Algorithm for Matrix Completion - Adi Shraibman ( Abstract )
3:30PM - 4:00PM MSRI, Atrium Tea
4:00PM - 4:50PM MSRI, Simons Auditorium Santosh Vempala Algorithmic Applications of M-Ellipsoids ( Abstract ) [Video available]
Friday, December 09, 2011
9:30AM - 10:30AM MSRI, Simons Auditorium Oded Regev Information Theoretic Techniques in Theoretical Computer Science III ( Abstract ) [Video available]
10:30AM - 11:00AM MSRI, Atrium Tea
11:00AM - 12:00PM MSRI, Simons Auditorium Tight Bounds for Distributed Functional Monitoring - David Woodruff ( Abstract ) [Video available]
12:00PM - 1:00PM MSRI, Simons Auditorium Remarks on Coresets for Minimum Enclosing Ellipsoids - Ken Clarkson ( Abstract ) [Video available]
1:00PM - 3:00PM MSRI, Atrium Lunch
Parent Program(s):
Quantitative Geometry


Questions about this workshop should be sent either by email to
or by regular mail to:
Quantitative Geometry in Computer Science
Mathematical Sciences Research Institute
17 Gauss Way, Berkeley, CA
94720-5070.
USA

The Institute is committed to the principles of Equal Opportunity and Affirmative Action.



|