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

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

(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

(computing theory) An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.

(mathematics) The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.

(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.

(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.

hash function

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

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