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

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

hash function

A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events.

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

Kolmogorov complexity

(Rubik's Cube) An algorithm for solving the Rubik's Cube by dividing the possible cube positions into groups.

(Rubik's Cube) An algorithm for solving the Rubik's Cube, an improvement on Thistlethwaite's algorithm.