A formal method for specifying and verifying algorithms. Tools, meetings, researchers in the area.
|
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.
http://www.cs.sunysb.edu/~algorith/
|
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.
http://sigact.acm.org/
|
A dictionary of algorithms, algorithmic techniques, data structures, and archetypical problems, with related definitions. Many entries have links to implementations, tutorials, and bibliographical references.
http://www.nist.gov/dads/
Site Statistics
- Total number of categories:0
- Total number of links:4
| | |