CSE 590z - Theory Seminar, Spring 2004

CSE Home

590z Previous Quarters

About Us

Search

Contact Info

This seminar meets Tuesdays, 1:30am-2:20pm in MGH 287.   To join the e-mail list for the seminar and to find out about other items of interest in theoretical computer science, students should sign up for the theory-students mailing list. View the email archive for the theory mailing list   590z this quarter will consist of a mix of external and internal speakers presenting current research. Talk Schedule      Day Speaker(s) Title Oct 5 Nati Linial Expanders: How to construct them and why Oct 12 Frank McSherry A Spectral Algorithm for Learning General Gaussian Mixtures Oct 19 Mohammad Mahdian Algorithms for online buffer management Oct 26 Ning Chen Incentive Compatibility and SemiDynamic Auctions Nov 2 Nate Segerlind Lower Bounds for Cutting Plane Logics via Communication Complexity --- an introduction to communication methods in proof complexity Nov 9 Assaf Naor Graph Partitioning, Clustering with Qualitative Information, and Grothendieck-type Inequalities Nov 16 Ryan O'Donnell Decision Trees Have Large Influences Nov 23 Amin Saberi On the Spread of Viruses on the Internet Nov 30 Adi Akavia Proving Hard-Core Predicates Using List Decoding Dec 7 Kunal Talwar Bypassing the Embedding: Algorithms for low dimensional metrics

Links:

Combinatorics Seminar at UW

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