An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.

(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares.

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

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

Synonym of Ramer-Douglas-Peucker algorithm

(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

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.