Author:
Carlson David A.,Sugla Binay
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems,Theoretical Computer Science,Software
Reference19 articles.
1. Aczel, J. and Daroczy, Z. 1975. On Measures of Information and Their Characterizations. Academic Press, New York.
2. Bilardi, G., and Preparata, F.P. 1989. Size-time complexity of boolean networks for prefix computations. JACM, 36, 2 (Apr.), 362?382.
3. Brent, R.P., and Kung, H.T. 1982. A regular layout for parallel adders. IEEE Trans. Comps., C-31, 3 (Mar.), 260?264.
4. Carlson, D.A., and Sugla, B. 1984. Time and processor efficient algorithms for linear recurrence equations and related problems. In Proc., 1984 Internat. Conf. on Parallel Processing (Aug.), pp. 310?314.
5. Carlson, D.A., and Sugla, B. 1989. Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays. Parallel Computing, 11, 1 (July), 93?106.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献