A prescribed finite set of well defined rules or processes for the solutions of a problem in a finite number of steps. Explained in simple English, it is the mathematical formula for an operation, such as computing the check digits on packets of data that travel via packet switched networks.
Special Interest Group on Algorithms and Computation Theory, the ACM special interest group for Theoretical Computer Science. Site has membership information, meetings, reports and a newsletter for members.
A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
An initiative of attendees of the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin board, and links to researchers and other resources in the field. The focus is on average case and probabilistic analysis.
This is a collection of implementations for 75 fundamental algorithms problems, including data structures, numerical and combinatorial algorithms, graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages.