Sunday, January 17

Session 4
Techniques I

9:00 AM-10:20 AM
Room: Liberty B
Chair: Dana Randall, Georgia Institute of Technology

9:00-9:17 Median Bounds and Their Applications
Alan Siegel, Courant Institute of Mathematical Sciences, New York University
9:20-9:37 New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
Tom Leighton, Massachusetts Institute of Technology; Satish Rao, NEC Research Institute; and Aravind Srinivasan, National University of Singapore, Singapore
9:40-9:57 Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms
E. G. Coffman, Jr. and A. L. Stolyar, Bell Laboratories, Lucent Technologies
10:00-10:17 Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes
Artur Czumaj, University of Paderborn, Germany; Przemka Kanarek, Miroslaw Kutylowski, and Krzystof Lorys, University of Wroclaw, Poland
New10:20-10:37 Emulations Between QSM, BSP and LogP: A Framework for General-Purpose Parallel Algorithm Design
Vijaya Ramachandran, Brian Grayson, and Michael D. Dahlin, University of Texas, Austin

SODA'99 Home


Program Updates

Author Index




tjf, 9/11/98; MMD, 12/4/98