CSE logo University of Washington Department of Computer Science & Engineering
 CSE 590z - Theory Seminar, Winter 2003
  CSE Home     590z Previous Quarters  About Us    Search    Contact Info 

    590z meets Tuesdays, 1:30-2:20pm in EE1 045.
View the combined email archive for cse590z@cs and theory-group@cs.
The plan for 590z this quarter is to intermix student presentations on topics including streaming algorithms for large datasets with talks by outside speakers.

Talk Schedule     

Day Speaker(s) Title
Jan 7 Tami Tamir Broadcasting schemes for media-on-demand
Jan 10, 3:30 Tal Malkin, AT&T Labs Secure Multiparty Computation of Approximations Sieg 322
Jan 14 Spyros Angelopoulos, U. Toronto On the Power of Priority Algorithms for Facility Location and Set Cover
Jan 21 Mohammad Mahdian, MIT Approximation Algorithms for the facility location problem
Jan 27, 3:30 Amin Saberi, Georgia Tech On the Hardness of Optimal Auctions EE1 042
Jan 28 Gidon Shavit, Erik Vee Streaming Algorithms, Part I: The Space Complexity of Approximating the Frequency Moments
Feb 4 Bill Pentney, Mike Ringenburg; Matt Cary Streaming Algorithms, Part II: Tracking Join and Self-Join Sizes in Limited Storage; L1 Distance Estimation
Feb 11 Tian Sang, Ioannis Giotis Streaming Algorithms, Part III
Feb 18 John Dunagan, Microsoft Research A polynomial-time linear programming solver based on the perceptron algorithm
Feb 25 NO SEMINAR Affiliates Meeting
Mar 4 Ashish Sabharwal, Parag The minimum size context-free grammar for a string: basic algorithms and lower bounds
Mar 11 Nilesh Dalvi, David Richardson Approximation algorithms for finding context-free grammars for strings
Apr 1 Neva Cherniavsky, Richard Ladner Coding context-free grammars and practical algorithms for finding context-free grammars for strings

CSE logo Department of Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX