DIMACS/CS Light
Seminar: Theoretical Computer Science
Fall 2006
Place:
CORE 431
Time:
Wednesdays 11:00 -- 12:00 Noon
Contacts:
Joe Kilian,
Mario Szegedy and
Eric Allender
Index number:
198:500:03 ( 09450 )
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 |
|
September 13 |
Josh Buresh-Oppenheim |
Towards Models for Backtracking and Dynamic Programming
|
|
|
September 20 |
Darakhshan J. Mir |
Related-Key Linear Cryptanalysis of DES
|
|
|
September 27 |
Martin J. Strauss |
Sublinear-time Heavy Hitters with Universal Guarantees
|
|
|
October 4 |
Neeraj Kayal |
Solvability of polynomial equations over finite fields
[pdf]
|
|
|
October 11 |
Juan Garay's talk postponed to December 13 | ||
|
October 18 |
Pierre McKenzie |
The Complexity of Solitaire
|
Lecture will take place in CORE A (301) |
|
October 25 |
Cancelled due to proximity with FOCS conference | ||
|
November 1 |
Konstantin Makarychev |
Approximation Algorithms for Unique Games
|
|
|
November 8 |
Anna Gilbert |
List-decoding of noisy Reed-Muller-like codes
|
|
|
November 15 |
Sean Hallgren |
TBA |
|
|
November 29 |
Bernard Chazelle |
Self-Improving Algorithms
|
|
|
December 6 |
Yury Makarychev |
Near-Optimal Algorithms for Maximum Constraint Satisfaction
|
|
|
December 13 |
Juan Garay |
Searchable Symmetric Encryption: Improved Definitions and
Efficient Constructions
|
Lecture will take place in CORE A (301) |