Journal of the ACM Bibliography
Abraham Waksman. A permutation
network. Journal of the ACM, 15(1):159-163, January 1968.
[BibTeX entry]
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.
- Paul Bay and Gianfranco Bilardi. Deterministic on-line routing on
area-universal networks. Journal of the ACM,
42(3):614-640, May 1995.
- R. F. Chamberlain and C. M. Fiduccia. Universality of
iterated networks. Mathematical Systems Theory,
27(5):381-430, September/October 1994.
- Friedhelm Meyer auf der Heide. Lower time bounds for solving linear
diophantine equations on several parallel computational models.
Information and Control, 67(1-3):195-211,
October/November/December 1985.
- Sandy Irani and Yuval Rabani. On the value of information
in coordination games (preliminary version). In 34th Annual
Symposium on Foundations of Computer Science, pages 12-21, Palo
Alto, California, 3-5 November 1993. IEEE.
- Sandy Irani and Yuval Rabani. On the value of
coordination in distributed decision making. SIAM Journal on
Computing, 25(3):498-519, June 1996.
- Abraham Waksman. Corrigendum: ``A permutation
network''. Journal of the ACM, 15(2):340, April 1968.
Shortcuts: