Author:
Aiello William A.,Leighton F. T.,Maggs Bruce M.,Newman Mark
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. W. Aiello and F. T. Leighton. Coding theory, hypercube embeddings, and fault tolerance. InProceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 1991.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting inc logn parallel steps.Combinatorica,3:1–19, 1983.
3. R. Aleliunas. Randomized parallel communication. InProceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 60–72, August 1982.
4. S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a non-blocking network. InProceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 149–158, May 1990.
5. K. Batcher. Sorting networks and their applications. InProceedings of the AFIPS Spring Joint Computing Conference, Volume 32, pages 307–314, 1968.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Breaking the VLB Barrier for Oblivious Reconfigurable Networks;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Hamming Codes, Hypercube Embeddings, and Fault Tolerance;SIAM Journal on Computing;2007-01
3. Hypercube Network Fault Tolerance: A Probabilistic Approach;Journal of Interconnection Networks;2005-03
4. Simultaneous Source Location;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2004
5. Communication in the two-way listen-in vertex-disjoint paths mode;Theoretical Computer Science;2001-08