DIMACS/CS Seminar: Theoretical Computer Science
Spring 2010

Place:                   CoRE 431
Time:                   Wednesdays 11:00 -- 12:00 Noon
Contacts:               Mario Szegedy, and Michael Saks
Index number (light seminar):     
198:500:04  (34630)

See also the schedule for the MATH and CS seminar series. Data on previous semesters is also available.
 
NOTE to external speakers: Please see dimacs webpage for directions.

DATE
  SPEAKER
TITLE (link to abstracts)
Notes
January 20

No Seminar This Week

January 27
Mario Szegedy
Random Numbers Certified by Bell's Theorem

February 3
Dmitry Gavinsky
Predictive Quantum Learning

February 10

Seminar Cancelled due to weather

February 17
William Matthews (UCSD)
Improved Algorithms for Unique Games via Divide and Conquer

February 24
Nikhil Bansal
A Primal Dual Approach for Online Algorithms
Originally scheduled for Feb 10: but cancelled due to weather
March 3
Liping Yuan

Acute Triangulations

March 10
Nisheeth Vishnoi
Algorithms vs Hardness

March 17

No seminar, spring break.

March 24
Mangesh Gupte
Differential privacy mechanisms that give optimal utility

March 31
Linda Sellie, Polytechnic Institute of NYU
Learning Random DNF over the Uniform Distribution

April 9
Aram Harrow
A quantum algorithm for solving linear systems of equations
Date changed because of FOCS deadline.
April 14
Eric Allender
Avoiding Simplicity is Complex

April 21
Martin Roetteler
Quantum algorithms for highly non-linear Boolean functions

April 28
Mario Szegedy
Streaming Algorithms for Independent Sets