Theory Seminar (CSE 590Z)

Autumn 1999

The seminar meets in EEB 218, Tuesdays at 1:30 pm.

Month Day Speaker Title
September 28 Richard Anderson Graphical Layout Algorithms Slides (ppt)
October 5 Paul Beame co-NP problems on random inputs Slides (ppt)
October 12 Christian Borgs (Microsoft) Slow mixing of Markov Chains
October 19 Doug Lind (UW Math) What is symbolic dynamics?
October 26 Jason Hartline Competitive Auctions
November 2 Dan Simon (Microsoft) Limits on the Efficiency of One-Way Permutation-Based Hash Functions
November 9 Moses Charikar (Stanford) Improved combinatorial algorithms for the facility location and k-median problems
November 16 Piotr Indyk (Stanford) Sublinear time algorithms for metric space problems
November 23 Andris Ambainis (UCB) Quantum lower bounds by quantum arguments
November 30 Eric Vogoda (UCB) Randomly Sampling Colorings of a Graph
December 7 Salil Vadhan (MIT) Verifiable Random Functions

Previous Quarters:
Winter 1999
Autumn 1998
Spring 1998

CSE 590z home