Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T. Leighton, and A. L Rosenberg. Optimal simulations by butterfly networks. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 192–204, May 1988.
2. Christos Kaklamanis, Danny Krizanc, and Satish Rao. New graph decompositions and fast emulations in hypercubes and butterflies. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), pages 325–334. ACM SIGACT, ACM SIGARCH, ACM Press, June 1993.
3. Christos Kaklamanis, Danny Krizanc, and Satish Rao. Universal emulations with sublogarithmic slowdown. In Proceedings of the 34th IEEE Symposium Foundations of Computer Science (FOCS), pages 341–350, 1993.
4. Richard R. Koch, F. T. Leighton, Bruce Maggs, Satish B. Rao, and Arnold L. Rosenberg. Work-preserving emulations of fixed-connection networks. In Proceedings of the 21st Symposium on Theory of Computation, pages 227–240, May 1989. Extended abstract.
5. M. Kunde. Routing and sorting on mesh-connected arrays. In J. Reif, editor, Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, volume 319 of Lecture Notes in Computer Science, pages 423–433. Springer-Verlag, July 1988.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Better algorithms for parallel backtracking;Parallel Algorithms for Irregularly Structured Problems;1995