(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.

(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.

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

(computer graphics) An algorithm that identifies which points (pixels) should be set in order to draw a straight line between two points.

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.

A step-by-step procedure, like an algorithm, but which is not guaranteed to halt on all inputs.

(computing theory) A quantum algorithm for finding the prime factors of an integer.

(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) An algorithm for transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order.

(computing theory) An algorithm for matrix multiplication.