A modulus-10 checksum algorithm used to validate various identification numbers, such as those on credit cards.

(computing theory) An algorithm for finding the contiguous subarray within a one-dimensional numeric array which has the largest sum.

(statistical mechanics) A criterion for choosing a probability distribution for the statistical ensemble of microstates of a thermodynamic system by minimizing the average log probability ⟨ ln p_i⟩=∑ᵢp_i ln p_i,, subject to the probability distribution pᵢ satisfying a set of constraints (usually expectation values) corresponding to the known macroscopic quantities.

(mathematics) An algorithm for finding sums of hypergeometric terms that are themselves hypergeometric terms.

(graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

(statistics) An algorithm for pseudorandom number sampling, relying on an underlying source of uniformly-distributed random numbers as well as computed tables.

(computing theory) An algorithm for matrix multiplication.

(computing theory) A concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication.

(computing theory) A recursive, nondeterministic, depth-first backtracking algorithm for solving the decision problem of whether an exact cover exists.

(computing) A variant of the Fisher-Yates shuffle that generates uniformly distributed cycles of some maximal length n, rather than permutations of the entire sequence.