plural of randomized algorithm

plural of Rete algorithm

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

plural of memetic algorithm

plural of Karatsuba algorithm

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

plural of Euclidean algorithm

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