DIMACS/CS Light Seminar: Theoretical Computer Science
Spring 2008

Place:                   CoRE 431
Time:                   Wednesdays 11:00 -- 12:00 Noon
Contacts:               Joe Kilian, Mario Szegedy and Endre Szemerédi
Index number:     
198:tba:tba  (tba)

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

TITLE (link to abstracts)
January 23
Jan Hladky
Loebl-Komlos-Sos Conjecture: dense case

January 30
Troy Lee
Disjointness is hard in the multi-party number-on-the-forehead model

February 6
Neeraj Kayal
The Power of Matrices of Partial Derivatives

February 13
Seshadhri Comandur
Parallel Monotonicity Reconstruction

February 20
Mario Szegedy
On the communication complexity of distributions

February 27
Mike Mislove
Information, compact monoids and geometry
Talk cancelled due to injury
March 5
Rajat Mittal
Product Theorem via semidefinite programming

March 12
Iordanis Kerenidis
Increasing the power of Honest Verifier Quantum Statistical Zero Knowledge proof systems

March 19

No Seminar
March 26
Harumichi Nishimura
Unbounded-Error Quantum Communication Complexity and Query Complexity

April 2
Dmitry Gavinsky
Classical Interaction Cannot Replace a Quantum Message

April 9

No Seminar
April 16
Venkatesan Guruswami
List decoding of binary codes: Improved results via new concatenation schemes

April 21
Navin Goyal
The VPN Conjecture is True
Special Monday Seminar
April 23
John Hitchcock
Density and Complexity of Instances in NP-Hard Sets

April 30
Andrew A. Chien
Essential Computing: Is Inference the key ingredient?
CS Dept. Distinguished Lecture