Quo Vadimus: computer science in a decade
J. F. Traub
A panel discussion was held during the third biennial meeting of chairmen of Ph.D.-granting computer science departments in June, 1978 at Snowbird, Utah, a meeting…
Author Archives
Numerical mathematics and computer science
Numerical mathematics is viewed as the analysis of continuous algorithms. Four of the components of numerical mathematics are discussed. These are: foundations (finite…
Algorithm 419: zeros of a complex polynomial [C2]
The subroutine CPOLY is a Fortran program to find all the zeros of a complex polynomial by the three-stage complex algorithm described in Jenkins and Traub [4]. (An…
ACM proposes to republish contents of Communications Algorithms section is useable looseleaf format, with bimonthly updating service, provided there is sufficient demand.…
The Vocabulary Subcommittee of the International Standards Organization's Technical Committee on Computers and Information Processing (ISO/TC97/SC1) held its third…
USA participation in an international standard glossary on information processing
A considerable number of glossaries in the area of information processing have been produced in the USA in the last ten years [1, 2]. In some cases the glossaries were…
On a class of iteration formulas and some historical notes
The class of iteration formulas obtainable by rational approximations of “Euler's formula” is derived with the corresponding error estimates. Some historical…
Comparison of iterative methods for the calculation of nth roots
Three iterative methods for calculation of nth roots (including one proposed by the author) are compared in two ways: (1) Theoretical convergence estimates are given. (2)…
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved