Dan E. Willard Multidimensional search trees that provide new types of memory reductions. [Citation Graph (1, 0)][DBLP] J. ACM, 1987, v:34, n:4, pp:846-858 [Journal]

Donald B. Johnson Parallel algorithms for minimum cuts and maximum flows in planar networks. [Citation Graph (0, 0)][DBLP] J. ACM, 1987, v:34, n:4, pp:950-967 [Journal]

Michael Kaminski A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. [Citation Graph (0, 0)][DBLP] J. ACM, 1987, v:34, n:4, pp:968-984 [Journal]

James McKenna Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks. [Citation Graph (0, 0)][DBLP] J. ACM, 1987, v:34, n:4, pp:985-1003 [Journal]