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.
- Artur Czumaj, Zvi Galil, Leszek G\c{a}sieniec, Kunsoo Park, and Wojciech Plandowski. Work-time-optimal parallel algorithms for string problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 713-722, Las Vegas, Nevada, 29 May-1 June 1995.
- 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.
- Volker Heun and Ernst W. Mayr. A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube. Journal of Algorithms, 20(2):375-399, March 1996.
- Ernst W. Mayr and Ralph Werchner. Divide-and-conquer algorithms on the hypercube. Theoretical Computer Science, 162(2):283-296, 20 August 1996.