Journal of the ACM Bibliography

Selected papers that cite this one

• Sanjeev Arora, F. T. Leighton, and Bruce M. Maggs. On-line algorithms for path selection in a nonblocking network. SIAM Journal on Computing, 25(3):600-625, June 1996.

• G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. An experimental analysis of parallel sorting algorithms. Theory of Computing Systems, 31(2):135-167, March/April 1998.

• Shenfeng Chen and John H. Reif. Using difficulty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs. In 34th Annual Symposium on Foundations of Computer Science, pages 104-112, Palo Alto, California, 3-5 November 1993. IEEE.

• Phillip B. Gibbons, Yossi Matias, and Vijaya Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 53(3):417-442, December 1996.

• Michael T. Goodrich. Communication-efficient parallel sorting (preliminary version). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 247-256, Philadelphia, Pennsylvania, 22-24 May 1996.

• Miltos D. Grammatikakis, D. Frank Hsu, and Jop F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77-132, 1 November 1998.

• David R. Helman, David A. Bader, and Joseph JáJá A randomized parallel sorting algorithm with an experimental study. Journal of Parallel and Distributed Computing, 52(1):1-23, 10 July 1998.

• M. Kaufmann and J. F. Sibeyn. Randomized multipacket routing and sorting on meshes. Algorithmica, 17(3):224-244, March 1997.

• Richard R. Koch, F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Arnold L. Rosenberg, and Eric J. Schwabe. Work-preserving emulations of fixed-connection networks. Journal of the ACM, 44(1):104-147, January 1997.

• Tom Leighton and C. Greg Plaxton. Hypercubic sorting networks. SIAM Journal on Computing, 27(1):1-47, February 1998.

• Bruce M. Maggs and Berthold Vöcking. Improved routing and sorting on multibutterflies. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 517-530, El Paso, Texas, 4-6 May 1997.

• Stephen Olariu and James L. Schwing. A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh. Journal of Parallel and Distributed Computing, 32(2):215-222, 1 February 1996.

• Sanguthevar Rajasekaran. Randomized selection on the hypercube. Journal of Parallel and Distributed Computing, 37(2):187-193, 15 September 1996.

• Sanguthevar Rajasekaran and David S. L. Wei. Selection, routing, and sorting on the star graph. Journal of Parallel and Distributed Computing, 41(2):225-233, 15 March 1997.

• John H. Reif and Sandeep Sen. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. SIAM Journal on Computing, 23(3):633-651, June 1994.

Shortcuts: