Publisher
Springer Berlin Heidelberg
Reference77 articles.
1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D.The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. Akl, S. G.Parallel Sorting Algorithms. Academic Press, 1985.
3. Akl, S. G.The Design and Analysis of Parallel Algorithms. Prentice Hall, 1989.
4. Alt, H. Comparing the combinational complexities of arithmetic functions. Journal of the ACM 35, 2 (Apr. 1988), 447–460.
5. Atallah, M. J., and Hambrusch, S. E. Solving tree problems on a mesh-connected processor array. In Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (1985), pp. 222–231.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献