- Alejandro A. Schäffer:
A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm. J. Algorithms 9(3): 321-342 (1988) - Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms 9(1): 47-62 (1988) - Arnold Schönhage:
Probabilistic Computation of Integer Polynomial GCDs. J. Algorithms 9(3): 365-371 (1988) - Danny Soroker:
Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems. J. Algorithms 9(2): 205-223 (1988) - Danny Soroker:
Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament. J. Algorithms 9(2): 276-286 (1988) - Wojciech Szpankowski:
Some Results on V-ary Asymmetric Tries. J. Algorithms 9(2): 224-244 (1988) - Jonathan S. Turner:
Almost All k-Colorable Graphs are Easy to Color. J. Algorithms 9(1): 63-82 (1988) - Robert E. Wilber:
The Concave Least-Weight Subsequence Problem Revisited. J. Algorithms 9(3): 418-425 (1988)
