An algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix.

(Internet) An algorithm for improving the efficiency of a network by combining a number of small packets, or messages, and later sending them in a single operation.

(computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n.

(mathematics) An iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L_∞ sense.

(computer graphics) A simple rendering technique that sorts all the polygons in a scene by their depth and then paints them in that order, from farthest to closest.

(computing theory) A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications.

A pattern-matching algorithm for implementing production rule systems, used to determine which of the system's rules should fire based on its data store.

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.