Selected papers that cite this one
- James Aspnes, Maurice Herlihy, and Nir Shavit. Counting networks. Journal of the ACM, 41(5):1020-1048, September 1994.
- Ronald I. Becker, David Nassimi, and Yehoshua Perl. The new class of g-chain periodic sorters. Journal of Parallel and Distributed Computing, 54(2):206-222, 1 November 1998.
- Costas Busch and Marios Mavronicolas. A combinatorial treatment of balancing networks. Journal of the ACM, 43(5):794-839, September 1996.
- Cynthia Dwork, Maurice Herlihy, and Orli Waarts. Contention in shared memory algorithms. Journal of the ACM, 44(6):779-805, November 1997.
- M. Kuty{\l}owski, K. Lory\'s, and B. Oesterdiekhoff. Periodic merging networks. Theory of Computing Systems, 31(5):551-578, September/October 1998.
- Christine Rüb. On Batcher's merge sorts as parallel sorting algorithms. In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 410-420, Paris France, 25-27 February 1998. Springer.