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

(computing) A randomized algorithm that always gives a correct result rather than merely giving a probably correct result.

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

Synonym of computational number theory.

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

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.

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