1. Editors' Foreword

   • Susanne E. Hambrusch
   • Bruce M. Maggs

   Pages: 211 - 211

2. Pipelining with Futures

   • G. E. Blelloch
   • M. Reid-Miller

   Pages: 213 - 239

3. Accessing Nearby Copies of Replicated Objects in a Distributed Environment

   • C. G. Plaxton
   • R. Rajaraman
   • A. W. Richa

   Pages: 241 - 280

4. Allocating Weighted Jobs in Parallel

   • P. Berenbrink
   • F. Meyer auf der Heide
   • K. Schröder

   Pages: 281 - 300

5. Efficient Detection of Determinacy Races in Cilk Programs

   • M. Feng
   • C. E. Leiserson

   Pages: 301 - 326

6. Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

   • P. B. Gibbons
   • Y. Matias
   • V. Ramachandran

   Pages: 327 - 359

7. On the Analysis of Randomized Load Balancing Schemes

   • M. Mitzenmacher

   Pages: 361 - 386

8. Simple, Efficient Routing Schemes for All-Optical Networks

   • M. Flammini
   • C. Scheideler

   Pages: 387 - 420