A Highly Parallel Algorithm for Root Extraction
IEEE Transactions on Computers
ACM Transactions on Programming Languages and Systems (TOPLAS)
A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
Communications of the ACM
Communications of the ACM
Lisp 1.5 decision tables implemented for a serial computer and proposed for parallel computers
ACM SIGPLAN Notices - Special issue on decision tables
Evaluation of redundancy in a parallel algorithm
IBM Systems Journal
Parallel algorithms for finding polynomial Roots on OTIS-torus
The Journal of Supercomputing
| Hi-index | 48.25 |