(mathematics, computing) The subdiscipline of informatics or computer science that studies algorithms.

Alternative form of algorithmic

A breadth-first search algorithm that finds optimal solutions for maze routing problems, used in the design of electronic components etc.

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

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

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

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.

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

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