Netlib / TOMS  Collected Algorithms of the ACM
Netlib / TOMS  Collected Algorithms of the ACM
Netlib/TOMS  Collected Algorithms of the ACM
An early mechanism for the distribution of useful implementations of
algorithms was
CALGO
, the Collected Algorithms of the ACM.
It first appeared in Communications of the ACM in 1960, covering
such famous algorithms as Floyd's lineartime build heap algorithm.
More recently, it has been the province of ACM Transactions on Mathematical
Software.
Each algorithm/implementation is described in a brief journal article,
with the implementation validated and collected.
A total of 750 algorithms have appeared to date.
Most of the codes are in Fortran, and of interest in numerical computing,
although several interesting combinatorial algorithms have slithered
into CALGO.
Since the implementations have been refereed, presumably they are more
reliable than most freely available software.
All the implementations below are available by ftp or WWW from
Netlib.
Algorithms of combinatorial interest include:

Bandwidth  508 509 529 582

Convex Hull  523

Cryptography  536

Decision Trees  606

Fourier Transforms  545

Generating Partitions  403

Generating Subsets  515

Geometric Primitives  550

Hamiltonian Cycle  595

High Precision Arithmetic  693

Knapsack  632

Linear Programming  551 552 559

Matching  548 575

Matrix Inversion  645

Minimum Cut (facility location)  558

Minimum Spanning Trees  479 613

Priority Queues  561

Random Numbers  488 599 712

Scheduling  520

Shortest Path  562

Solving Linear Equations  533 576 578

Sorting  410 505

Sparse Matrix  601

Text Compression  673

Traveling Salesman Problem  608 750

Triangulation  624

Unconstrained Optimization  500 566 611 630 702 734 739 744
A bibliography and keywords appear in Algorithm 620.
Collected Algorithms of the ACM
Link to TOMS distribution
Link to Netlib
Problem Links
Bandwidth Reduction (9)
Constrained and Unconstrained Optimization (8)
Solving Linear Equations (7)
Discrete Fourier Transform (6)
Generating Partitions (6)
Hamiltonian Cycle (6)
Knapsack Problem (6)
Matrix Multiplication (6)
Random Number Generation (6)
Traveling Salesman Problem (6)
Arbitrary Precision Arithmetic (5)
Minimum Spanning Tree (5)
Text Compression (5)
Linear Programming (4)
Job Scheduling (4)
Shortest Path (4)
Sorting (4)
Triangulation (4)
Convex Hull (3)
Cryptography (3)
Generating Subsets (3)
Matching (3)
Priority Queues (3)
Voronoi Diagrams (3)
About the Book
Send us Mail
Go to Main Page
This page last modified on May 17, 1997.