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

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

An inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions. It uses dynamic programming to compute the values in two passes, the first going forward in time and the second backward.

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

An algorithm for finding a solution to the stable marriage problem in polynomial time.

(computer science) An algorithm for matrix multiplication.

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.

(computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.