Time Bounds on the Parallel Evaluation of Arithmetic Expressions
- 1 June 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (2) , 147-162
- https://doi.org/10.1137/0204012
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973
- The Parallel Evaluation of Arithmetic Expressions Without DivisionIEEE Transactions on Computers, 1973
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of EquationsJournal of the ACM, 1973
- On the time required for a sequence of matrix productsCommunications of the ACM, 1973
- On the Parallel Evaluation of PolynomialsIEEE Transactions on Computers, 1973
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting SpeedupIEEE Transactions on Computers, 1972
- An axiomatic approach to code optimization for expressionsJournal of the ACM, 1972
- On the Addition of Binary NumbersIEEE Transactions on Computers, 1970