Theory Seminar (CSE 590Z)

Autumn 2000

The seminar meets in Loew 116, Tuesdays at 1:30 pm.

Month Day Speaker Title
September 26 Faculty Research Overview
October 3 Jason Hartline & Brian Tjaden Presenting Charikar, et al's Query Strategies for Priced Information
October 10 Chris Umans Approximability and Completeness in the Polynomial Hierarchy
October 17 Richard Ladner On-line Stream Merging Algorithms
October 24 Prasad Tetali Isoperimetric and functional inequalities
October 31 Kamal Jain Applications of approximation algorithms in cooperative game theory
November 7 Martin Dyer Markov chains for randomly H-colouring a graph
November 14 NO SEMINAR - see ZZ below for November 15 FOCS conference
November 15 Venkat Guruswami in ZZ seminar 2:30 pm
November 21 Laci Lovasz Sampling Algorithms and Markov Chains
November 28 Amos Fiat
December 5 Adam Kalai


Trends in UW Theory (CSE 590ZZ)

Autumn 2000

This is a new seminar in which UW theory students and faculty present their ongoing research in an informal setting. It meets in EE1 025, Wednesdays at 2:30 pm.

Month Day Speaker Subjects
September 27 Frank McSherry Cool stuff I did on my summer non-vacation
October 4 Ed Hong & Theory Night Query Strategies for Max
October 11 Richard Ladner Algorithms for Stream Merging for Media-on-Demand
October 18 Anna Karlin Stories about e/(e-1)
October 25 Gerome Miklau Tree automata and expressive power of query languages
Novemeber 1 Matt Cary Nearest Neighbor Trees
November 8 Ashish Sabharwal Resolution Complexity of Independent Sets in Random Graphs
November 15 Venkat Guruswami in ZZ seminar 2:30 pm Hardness of Approximate Hypergraph Coloring
November 22 Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
November 29 Jason Hartline Competitive Auctions
December 6 Erik Vee Time-space tradeoff lower bounds

Previous Quarters:
Spring 2000
Winter 2000
Autumn 1999
Winter 1999
Autumn 1998
Spring 1998

CSE 590z home