Journal of the ACM Bibliography
James Aspnes, Maurice Herlihy, and Nir Shavit. Counting networks.
Journal of the ACM, 41(5):1020-1048, September 1994.
[BibTeX entry]
Selected papers that cite this one
- Costas Busch and Marios Mavronicolas. A combinatorial treatment of
balancing networks. Journal of the ACM, 43(5):794-839,
September 1996.
- Costas Busch and Marios Mavronicolas. Impossibility results for
weak threshold networks. Information Processing
Letters, 63(2):85-90, 28 July 1997.
- Maurice Herlihy and Sergio Rajsbaum. The decidability of
distributed decision tasks (extended abstract). In Proceedings
of the Twenty-Ninth Annual ACM Symposium on Theory of Computing,
pages 589-598, El Paso, Texas, 4-6 May 1997.
- N. Shavit and D. Touitou. Elimination trees and the
construction of pools and stacks. Theory of Computing
Systems, 30(6):645-670, November/December 1997.
- N. Shavit, E. Upfal, and A. Zemach. A steady state analysis
of diffracting trees. Theory of Computing Systems,
31(4):403-423, July/August 1998.
Selected references
- M. Ajtai, J. Komlós, and E. Szemerédi. An O(n
log n) sorting network. In Proceedings of the
Fifteenth Annual ACM Symposium on Theory of Computing, pages 1-9,
Boston, Massachusetts, 25-27 April 1983.
- James Aspnes, Maurice Herlihy, and Nir Shavit. Counting networks and
multi-processor coordination. In Proceedings of the Twenty
Third Annual ACM Symposium on Theory of Computing, pages 348-358,
New Orleans, Louisiana, 6-8 May 1991.
- Martin Dowd, Yehoshua Perl, Larry Rudolph, and Michael Saks. The periodic balanced sorting
network. Journal of the ACM, 36(4):738-757, October
1989.
- Maurice Herlihy, Nir Shavit, and Orli Waarts. Low contention
linearizable counting. In 32nd Annual Symposium on Foundations
of Computer Science, pages 526-535, San Juan, Puerto Rico, 1-4
October 1991. IEEE.
- Michael Klugerman and C. Greg Plaxton. Small-depth counting
networks. In Proceedings of the Twenty-Fourth Annual ACM
Symposium on the Theory of Computing, pages 417-428, Victoria,
British Columbia, Canada, 4-6 May 1992.
- David Peleg and Eli Upfal. The token distribution
problem (preliminary version). In 27th Annual Symposium on
Foundations of Computer Science, pages 418-427, Toronto, Ontario,
Canada, 27-29 October 1986. IEEE.
Shortcuts: