theory seminar this week and next (fridays 11:30 ee1 045)

From: Anna Karlin (karlin@cs.washington.edu)
Date: Thu May 27 2004 - 12:40:26 PDT

  • Next message: Kelli McGee \(Kelly Services Inc\): "06/01/2004 - Maximal Independent sets in graphs and Segre's problem; Van Vu, University of California, San Diego, Visiting MSR"

    For the last two weeks of the quarter, Ioannis Giotis, David Richardson, Neva Cherniavsky and Gideon Shavit will be presenting the new square root log n approximation algorithm for sparsest cut.

    Expander Flows, Geometric Embeddings, and Graph Partitionings.
    Sanjeev Arora, Satish Rao, and Umesh Vazirani. ACM Symposium on Theory of Computing, 2004.

    _______________________________________________
    Theory-group mailing list
    Theory-group@cs.washington.edu
    http://mailman.cs.washington.edu/mailman/listinfo/theory-group

  • Next message: Kelli McGee \(Kelly Services Inc\): "06/01/2004 - Maximal Independent sets in graphs and Segre's problem; Van Vu, University of California, San Diego, Visiting MSR"

    This archive was generated by hypermail 2.1.6 : Thu May 27 2004 - 12:40:39 PDT