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

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.

plural of spigot algorithm

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

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

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

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

Synonym of computational number theory.