DATE
|
SPEAKER
|
TITLE
(link to
abstracts)
|
Notes
|
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
|