An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling T. H. RomerL. E. Rosier OriginalPaper Pages: 1 - 10
Optimal parallel verification of minimum spanning trees in logarithmic time B. DixonR. E. Tarjan OriginalPaper Pages: 11 - 18
“The big sweep”: On the power of the wavefront approach to Voronoi diagrams F. DehneR. Klein OriginalPaper Pages: 19 - 32
Efficient construction of a bounded-degree spanner with low weight S. AryaM. Smid OriginalPaper Pages: 33 - 54
Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs J. Bang-JensenM. El HaddadT. M. Przytycka OriginalPaper Pages: 67 - 87