1. Editor's foreword

   • Arnold L. Rosenberg

   EditorialNotes Pages: 379 - 379

2. Universality of iterated networks

   • R. F. Chamberlain
   • C. M. Fiduccia

   OriginalPaper Pages: 381 - 430

3. Designing broadcasting algorithms in the postal model for message-passing systems

   • A. Bar-Noy
   • S. Kipnis

   OriginalPaper Pages: 431 - 452

4. Primitives for asynchronous list compression

   • R. J. Anderson

   OriginalPaper Pages: 453 - 470

5. Branch-and-bound and backtrack search on mesh-connected arrays of processors

   • C. Kaklamanis
   • G. Persiano

   OriginalPaper Pages: 471 - 489

6. A lower bound for sorting networks based on the shuffle permutation

   • C. G. Plaxton
   • T. Suel

   OriginalPaper Pages: 491 - 508