Algorithms and Complexity Seminar: Fall 2007
Organizers: Nick Harvey and Ning Xie.
The Algorithms and Complexity seminar for Fall 2007 will
meet Thursdays from 4pm-5:15pm in
G575 (Theory Lab).
The style and format of these meetings are quite variable. Please feel free to
contact the host to find out more details. Contact Nick Harvey to be
added to the mailing list for these seminars.
-
Thursday, September 27, 2007:
Speaker:
Paul Valiant
(MIT).
Topic:
Lower Bounds for Testing Symmetric Properties of Distributions
.
Host: Nick Harvey
-
Thursday, October 4, 2007:
No A&C seminar due to conflict with
Shang-Hua Teng's talk in the ORC.
-
Thursday, October 11, 2007:
Speaker:
Krzysztof Onak
(MIT).
Topic:
Testing for Concise Representations
.
Host: Ning Xie
-
Thursday, October 18, 2007:
Speaker:
Andrew McGregor
(UCSD).
Topic:
The Order of the Data Stream
.
Host: Piotr Indyk
-
Wednesday, October 24, 2007
(note unusual day):
Speaker:
Louay Bazzi
(American University of Beirut).
Topic:
Polylogarithmic independence can fool DNF formulas.
Host: Madhu Sudan
-
Thursday, November 1, 2007:
Speaker:
Esther Ezra
(Duke).
Topic:
Substructures in Geometric Arrangements
.
Host: Erik Demaine
-
Thursday, November 8, 2007:
Speaker:
Ben Rossman
(MIT).
Topic:
On the constant-depth complexity of k-clique
.
Host: Madhu Sudan
-
Thursday, November 15, 2007:
Speaker:
Scott Aaronson
(MIT).
Topic:
The Complexity of Agreement
.
Host: Ning Xie
-
Thursday, November 22, 2007:
Thanksgiving Holiday - No A&C seminar
-
Thursday, November 29, 2007:
Speaker:
Yury Lifshits
(Caltech).
Topic:
Combinatorial Approach to Data Mining
.
Host: Piotr Indyk
-
Monday, December 3, 2007:
Speaker:
Vahab Mirrokni
(MSR Redmond).
Topic:
Maximizing submodular functions with applications
.
Host: Andreas Schulz
Archives from previous semesters:
People who attended talks like these also attended: