- adler32 - Adler32 is a hash algorithm CRC-32, except that it is much faster and carries a slightly higher probability of collisions
- Blowfish - An LLGPL CL implementation of the Blowfish encryption algorithm has been posted to comp.lang.lisp by Alain Picard:
- Bordeaux-FFT - Bordeaux-FFT is a fast, pure-Lisp implementation of Fast Fourier Transforms
- cl-buchberger - cl-buchberger is a Common Lisp implementation of Buchberger's algorithm for the computation of Gröbner bases
- cl-grnm - cl-grnm is an implementation of the Nelder-Mead and Grid Restrained Nelder-Mead nonlinear optimization algorithms
- CL-ID3 - CL-ID3 is a pure Common Lisp implementation of the well-known ID3 AI/data-mining algorithm
- cl-jointgen - The CL-JOINTGEN Library provides a Common Lisp implementation of the
- cl-satwrap - A thin generic SAT (propositional satisfiability problem) solver interface to your favorite “industrial-strength” SAT solver
- CLLIB - CLLIB is a varied collection of Common lisp tools and routines in CLOCC
- CRC-32 - A library to compute the CRC-32 algorithm that is described in RFC 1952
- decisiontree - This package provides an implementation of an algorithm that creates a decision tree
- floyd-warshall - floyd-warshall is a (very) preliminary library for Floyd-Warshall all-pairs shortest-path algorithm computations on weighted directed Graphs, written by Robert Goldman.
- Levenshtein - The Levenshtein Distance algorithm finds the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character
- Mersenne Twister - The Mersenne Twister is a pseudorandom number generation algorithm created by Makoto Matsumoto
- SEMI-PRECIOUS - SEMI-PRECIOUS is a library of algorithms/data structures
- SHA1 - Secure Hash Algorithm 1 (SHA1) is defined in RFC
- SimpSamp - SimpSamp is a statistics library for simple random sampling without replacement
- Soundex - The Soundex algorithm indexes words by their sound when pronounced in English, for example to account for differences in spelling
- ulimyhmpqs - ulimyhmpqs is an implementation of the Hypercube Multiple Polynomial Quadratic Sieve (HMPQS), an algorithm for the factorisation of large (up to about 110 digits, where the Number Field Sieve (NFS) algorithms become more efficient) integers

algorithm

Algorithms for doing various complicated things (mostly math-related).