(computing theory) A certain unsupervised learning algorithm for neural networks, having separate "wake" and "sleep" phases that attempt to connect the layers of neurons in alternating directions.

(computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.

(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph.

(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

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