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

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.

(mathematics) An algorithm for finding sums of hypergeometric terms that are themselves hypergeometric terms.

(graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph.

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