Author:
Rajopadhye Sanjay,Tadonki Claude,Risset Tanguy
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A. Benaini, P. Quinton, Y. Robert, Y. Saouter, and B. Tourancheau. Synthesis of a new systolic architecture for the algebraic path problem. Science of Computer Programming. 15:135–158, 1990.
2. A. Benaini and Y. Robert. Space-time minimal systolic arrays for gaussian elimination and the algebraic path problem. In ASAP 90: International Conference on Application Specific Array Processors, pages 746–757, Princeton, NJ, September 1990. IEEE Press.
3. P.Y. Chang and J.C. Tsay. A family of efficient regular arrays for the algebraic path problem. IEEE Transactions on Computers, 43(7):769–777, July 1994.
4. P. Clauss, C. Mongenet, and G-R. Perrin. Synthesis of size-optimal toroidal arrays for the algebraic path problem: A new contribution. Parallel Computing, 18:185–194, 1992.
5. L. Guibas, H.T. Kung, and Clark D. Thompson. Direct VLSI implementation of combinatorial algorithms. In Proc. Conference on Very Large Scale Integration: Architecture, Design and Fabrication, pages 509–525, January 1979.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献