1. On the Influence of Lookahead in Competitive Paging Algorithms

   • S. Albers

   Pages: 283 - 305

2. Trekking in the Alps Without Freezing or Getting Tired

   • M. de Berg
   • M. van Kreveld

   Pages: 306 - 323

3. Combine and Conquer

   • R. F. Cohen
   • R. Tamassia

   Pages: 324 - 362

4. Multicommodity Flows in Even, Planar Networks

   • K. Weihe

   Pages: 363 - 363

5. An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem

   • Vijaya Ramachandran
   • Honghua Yang

   Pages: 384 - 404

6. The Bit Complexity of Distributed Sorting

   • O. Gerstel
   • S. Zaks

   Pages: 405 - 416

7. Routing on Meshes with Buses

   • M. Kaufmann
   • R. Raman
   • J. F. Sibeyn

   Pages: 417 - 444

8. Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks

   • E. W. Mayr
   • R. Werchner

   Pages: 445 - 460