(mathematics) Any algorithm that uses randomness as part of its logic.

(computing) A method of finding a nearly optimal solution to an optimization problem that cannot be solved exactly within a reasonable time.

(historical) Any of certain algorithms first described in Euclid's Elements.

(computing) A search heuristic that is based on biological evolution.

An algorithm for the evolution of genotypes, which includes a selected, non-genetic component.

Informally, the property of a string being not longer than any computer program that can produce that string; that is, the property of a string being incompressible.

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