Selected papers that cite this one
- F. Aurenhammer and J. Hagauer. Recognizing binary Hamming graphs in O(n^2 log n) time. Mathematical Systems Theory, 28(5):387-395, September/October 1995.
- Michael T. Goodrich and S. Rao Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. Journal of the ACM, 43(2):331-361, March 1996.
- David S. Greenberg, James K. Park, and Eric J. Schwabe. The cost of complex communication on simple networks. Journal of Parallel and Distributed Computing, 35(2):133-141, 15 June 1996.
- Xiangdong Yu and Moti Yung. Scheduling task-trees with additive scales on parallel/distributed machines. Theoretical Computer Science, 181(2):357-378, 30 July 1997.