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

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

(statistics) An algorithm for pseudorandom number sampling, relying on an underlying source of uniformly-distributed random numbers as well as computed tables.

plural of ziggurat algorithm

(computing theory) A concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication.

(statistical mechanics) A criterion for choosing a probability distribution for the statistical ensemble of microstates of a thermodynamic system by minimizing the average log probability ⟨ ln p_i⟩=∑ᵢp_i ln p_i,, subject to the probability distribution pᵢ satisfying a set of constraints (usually expectation values) corresponding to the known macroscopic quantities.

(computing theory) An algorithm for matrix multiplication.

(computing theory) A recursive, nondeterministic, depth-first backtracking algorithm for solving the decision problem of whether an exact cover exists.

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