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

    This seminar meets Tuesdays, 1:30pm-2:20pm in CSE 403.
 
To join the e-mail list for the seminar and to find out about other items of interest in theoretical computer science:

View the email archive for theory-group for the theory mailing list

 
590z this quarter will primarily have talks by outside speakers presenting current research.


Talk Schedule     

Day Speaker(s) Title
Oct 3 Allan Borodin Simply stated, what is a greedy algorithm and why it may not be so simple
Oct 10 T.S. Jayram INDEX coding with side information
Oct 17 Sanjeev Arora Multiplicative Weight Method: A general algorithmic tool (with applications to linear and semidefinite programming
Oct 19, 4:30pm Yuval Rabani The effectiveness of Lloyd-type methods for the k-means problem
Oct 24 FOCS -- No meeting
Oct 31 Roee Engelberg Equilibria in Online Games
Nov 7 Uri Feige Witnesses for nonsatisfiability of dense random 3CNF formulas
Nov 14 Yossi Azar Optimal Node Routing
Nov 21 Eden Chlamtac New Approximation Guarantee for Chromatic Number
Nov 28 CANCELLED
Dec 5 Prasad Tetali The square dependence problem and factoring



Links:


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