DIMACS/CS Seminar: Theoretical Computer Science
Fall 2009

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.

TITLE (link to abstracts)
September 2

No Seminar This Week

September 9
Troy Lee
Rank minimization via the gamma_2 norm

September 16
Mihai Patrascu
Lower Bounds for Succinct Data Structures

September 23
Gabor Kun
Cops and robbers in random graphs.

September 30
Ashwin Nayak
Fault-tolerant quantum communication with constant overhead
Visitor in Rutgers
October 7
Bahman Kalantari
Voronoi Diagrams and Polynomial Root-Finding

October 14
Amir Yehudayoff

On integer sum of squares (joint work with P. Hrubes and A. Wigderson)

October 21
Jeremie Roland
Adiabatic quantum optimization fails for random instances of NP-complete problems

October 28
Yuichi Yoshida, Kyoto University
A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness
Visitor in Rutgers
November 4

Seminar Cancelled
Dimacs mixer at AT&T labs
November 11
William Steiger
Geometric Partitioning

November 18
Vinod Vaikuntanathan
Cryptography with Hardly Any Secrets
Seminar is in CORE A (Core 301)
November 25

No Seminar This Week
Thanksgiving Recess
December 2
Dr. Yehuda Koren, Yahoo! Research.
The Netflix Prize: Quest for $1,000,000
Core Auditorium (Room 101)
December 9
Srikanth Srinivasan
Circuit Lower Bounds, Help Functions, and the Remote Point Problem