plural of Karatsuba algorithm

(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) A variant of the Fisher-Yates shuffle that generates uniformly distributed cycles of some maximal length n, rather than permutations of the entire sequence.

Alternative form of Warnock algorithm

(computer graphics) An algorithm that solves the problem of rendering a complicated image by recursive subdivision of a scene until areas are obtained that are trivial to compute.

An algorithm for computing the value of a transcendental number, generating its digits sequentially with increasing precision.

plural of spigot algorithm

A breadth-first search algorithm that finds optimal solutions for maze routing problems, used in the design of electronic components etc.

(logic) An algorithm for checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic.

(numerical analysis) An algorithm that significantly reduces the numerical error in the total obtained by adding a sequence of finite-precision floating-point numbers, compared to the obvious approach, by tracking the accumulated small errors in a separate variable.