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

(computer science) An algorithm for matrix multiplication.

Synonym of computational number theory.

An algorithm used to find the unknown parameters of a hidden Markov model.

plural of Reingold-Tilford algorithm

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

plural of Las Vegas algorithm

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

(computing theory) A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked.