Browse this catalog of approximation results for NP optimization problems. Covers graph theory, network design, sets, sequencing, and storage.

Downloadable book written by Herbert S. Wilf discusses recursive algorithms, network flow problems, and mathematical preliminaries.

Specializes in the design of algorithms, computer algebra, combinatorial analysis, and asymptotics. View publications in English and French.

Forum for the discussion of average case and probabilistic analysis of algorithms includes problems and links to research projects.

Features an overview of average case computational complexity theory and intractable NP problems.

Browse an archive of algorithms created by members of the Association for Computing Machinery. Download compressed files.

Review research projects in areas such as quantum computing, breaking intractability, low discrepancy algorithms, and randomization.

Includes algorithms designed for sequential, sorted array, hashing, recursive structure and multidimensional searches.

Browse an extensive library of algorithms for combinatorial computing. View demos, and learn about licensing for scientific and commercial use.

Search a Cambridge University archive of algorithms designed for research in materials science and metallurgy.

Algorithm research organization provides the full text of its reports. Papers are in various formats, including PostScript, .pdf and .dvi.

Provides an overview and demos of some common sorting algorithms, with links to relevant code in Java.

Features implementations for over seventy key problems in combinatorial algorithms. Browse by problem category or programming language.

Learn about Strmat, a group of C programs designed to implement string matching and pattern discovery algorithms. Download a copy.

Read a paper discussing research in parallel algorithms and reconfigurable meshes, used to solve problems in geometry, arithmetic and sorting.