The Parallel Complexity of Arithmetic Computation
暂无分享,去创建一个
[1] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[2] Gerald Estrin,et al. Organization of computer systems: the fixed plus variable structure computer , 1960, IRE-AIEE-ACM '60 (Western).
[3] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.
[4] P. Erdös. Remarks on number theory III. On addition chains , 1960 .
[5] Richard Brent. On the Addition of Binary Numbers , 1970, IEEE Transactions on Computers.
[6] Joseph F. Traub,et al. Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers , 1976, JACM.
[7] Shmuel Winograd. Parallel Iteration Methods , 1972, Complexity of Computer Computations.
[8] Kiyoshi M. Maruyama,et al. On the Parallel Evaluation of Polynomials , 1973, IEEE Transactions on Computers.
[9] Harold S. Stone,et al. An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations , 1973, JACM.
[10] J. Ian Munro,et al. Optimal Algorithms for Parallel Polynomial Evaluation , 1971, J. Comput. Syst. Sci..
[11] Don Heller,et al. A Determinant Theorem with Applications to Parallel Algorithms , 1974 .
[12] W. Morven Gentleman,et al. Some Complexity Results for Matrix Computations on Parallel Processors , 1978, JACM.
[13] V. Strassen. Gaussian elimination is not optimal , 1969 .
[14] A. Brauer. On addition chains , 1939 .
[15] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.
[16] David E. Muller,et al. Restructuring of Arithmetic Expressions For Parallel Evaluation , 1976, JACM.