Author:
Greenberg David S.,Heath Lenwood S.,Rosenberg Arnold L.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman (1974):The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. F. Berman and L. Snyder (1987): On mapping parallel algorithms into parallel architectures.J. Parallel Distrib. Comput.,4, 439–458.
3. S. N. Bhatt and J.-Y. Cai (1988): Take a walk, grow a tree.Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 469–478.
4. S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T. Leighton, and A. L. Rosenberg (1988): Optimal simulations by Butterfly networks. Tech. Rpt. 88-55, University of Massachusetts; submitted for publication. See also,Proc. 20th ACM Symp. on Theory of Computing, pp. 192–204.
5. S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg (1988): Efficient embeddings of trees in hypercubes. Tech. Rpt. 88–94, University of Massachusetts; submitted for publication. See also, (1986): Optimal simulations of tree machines.Proc. 27th IEEE Symp. on Foundations of Computer Science pp. 274–282.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献