(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

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

A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.

(computing) A search procedure which involves generating and checking all possible scenarios.

(computing theory) A method for parsing mathematical expressions specified in infix notation.

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.

(computing theory) A multiplication algorithm that multiplies large integers by recursively splitting them into smaller parts and performing operations on the parts.

A common recursive fast Fourier transform algorithm.

(computing theory) An asymptotically fast recursive multiplication algorithm for large integers.