GAMS: a framework for the management of scientific software
ACM Transactions on Mathematical Software (TOMS)
Distribution of mathematical software via electronic mail
Communications of the ACM
ACM Transactions on Mathematical Software (TOMS)
Algorithm 665: Machar: a subroutine to dynamically determined machine parameters
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
A comment on the Eispack machine epsilon routine
ACM SIGNUM Newsletter
Self-adapting Fortran 77 machine constants: comment on Algorithm 528
ACM Transactions on Mathematical Software (TOMS)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Parameterization of the Environment for Transportable Numerical Software
ACM Transactions on Mathematical Software (TOMS)
The PORT Mathematical Subroutine Library
ACM Transactions on Mathematical Software (TOMS)
Algorithm 528: Framework for a Portable Library [Z]
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
A More Portable Fortran Random Number Generator
ACM Transactions on Mathematical Software (TOMS)
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Algorithms: Algorithm 332: Jacobi polynomials
Communications of the ACM
Communications of the ACM
Open Source Development with CVS
Open Source Development with CVS
Programming Perl
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Hi-index | 0.00 |
Since 1960 the Association for Computing Machinery has published a series of refereed algorithm implementations known as the Collected Algorithms of the ACM (CALGO). Most of those published since 1975 are mathematical algorithms, and many of them remain useful today. In this paper we describe measures that have been taken to bring some 300 of these latter codes to an up-to-date and consistent state.