Session 9

8:30-8:50 The Variance of Two Game Tree Algorithms

Yanjun Zhang, Southern Methodist University

8:55-9:15 Nearly Optimal Distributed Edge Coloring in O(loglog n) Rounds

David A. Grable, Humboldt-Universität zu Berlin, Germany; and Alessandro Panconesi, Freie Universität Berlin, Germany

9:20-9:40 Probabilistic Analysis for Scheduling with Conflicts

Sandy Irani and Vitus Leung, University of California, Irvine

9:45-10:05 The Algorithmic Aspects of Uncrowded Hypergraphs

Claudia Bertram-Kretzberg and Hanno Lefmann, Universität Dortmund, Germany

Registration | Hotel Information | Transportation | Program-at-a-Glance | Author Index