1. A 2n−2 step algorithm for routing in ann ×n array with constant-size queues

   • T. Leighton
   • F. Makedon
   • I. G. Tollis

   OriginalPaper Pages: 291 - 304

2. Balancing minimum spanning trees and shortest-path trees

   • S. Khuller
   • B. Raghavachari
   • N. Young

   OriginalPaper Pages: 305 - 321

3. An efficient parallel algorithm for shortest paths in planar layered digraphs

   • S. Subramanian
   • R. Tamassia
   • J. S. Vitter

   OriginalPaper Pages: 322 - 339

4. Bottom-up mergesort — A detailed analysis

   • W. Panny
   • H. Prodinger

   OriginalPaper Pages: 340 - 354

5. Finding all periods and initial palindromes of a string in parallel

   • D. Breslauer
   • Z. Galil

   OriginalPaper Pages: 355 - 366