1. One-by-One Cleaning for Practical Parallel List Ranking

   • Sibeyn

   OriginalPaper Pages: 345 - 363

2. Lower Bounds for Dynamic Data Structures on Algebraic RAMs

   • Ben-Amram
   • Galil

   OriginalPaper Pages: 364 - 395

3. Minimum Congestion Redundant Assignments to Tolerate Random Faults

   • Fotakis
   • Spirakis

   OriginalPaper Pages: 396 - 422

4. Embedding Linkages on an Integer Lattice

   • Landau
   • Immerman

   OriginalPaper Pages: 423 - 436

5. A Functional Approach to External Graph Algorithms

   • Abello
   • Buchsbaum
   • Westbrook

   OriginalPaper Pages: 437 - 458

6. Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach

   • Cohen
   • Kaplan

   OriginalPaper Pages: 459 - 466

7. Routing Flow Through a Strongly Connected Graph

   • Erlebach
   • Hagerup

   OriginalPaper Pages: 467 - 473

8. Quasi-Upward Planarity

   • Bertolazzi
   • Di Battista
   • Didimo

   OriginalPaper Pages: 474 - 506

9. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

   • Jansen
   • Porkolab

   OriginalPaper Pages: 507 - 520