Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. W. Aiello, T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 55–64, July 1990.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c logr n parallel steps. Combinatorica, 3:1–19, 1983.
3. S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a non-blocking network. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 149–158, May 1990.
4. L. A. Bassalygo and M. S. Pinsker. Complexity of optimum nonblocking switching network without reconnections. Problems of Information Transmission, 9:64–66, 1974.
5. A. DeHon, T. Knight, and H. Minsky. Fault-tolerant design for multistage routing networks. Unpublished manuscript, AI Lab, MIT, Cambridge, MA, 1990.