1. An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling

   • T. H. Romer
   • L. E. Rosier

   OriginalPaper Pages: 1 - 10

2. Optimal parallel verification of minimum spanning trees in logarithmic time

   • B. Dixon
   • R. E. Tarjan

   OriginalPaper Pages: 11 - 18

3. “The big sweep”: On the power of the wavefront approach to Voronoi diagrams

   • F. Dehne
   • R. Klein

   OriginalPaper Pages: 19 - 32

4. Efficient construction of a bounded-degree spanner with low weight

   • S. Arya
   • M. Smid

   OriginalPaper Pages: 33 - 54

5. Fast integer merging on the EREW PRAM

   • T. Hagerup
   • M. Kutyłowski

   OriginalPaper Pages: 55 - 66

6. Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs

   • J. Bang-Jensen
   • M. El Haddad
   • T. M. Przytycka

   OriginalPaper Pages: 67 - 87