Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on distributed...

Ricart–Agrawala algorithm (an improvement over Lamport's algorithm) Lamport's bakery algorithm Raymond's algorithm Maekawa's algorithm Suzuki–Kasami algorithm Naimi–Trehel...

algorithm Lamport's distributed mutual exclusion algorithm Maekawa's algorithm Suzuki–Kasami algorithm Raymond's algorithm Naimi–Trehel's algorithm Ricart...

algorithm Mutual exclusion Lamport's Distributed Mutual Exclusion Algorithm Naimi-Trehel's log(n) Algorithm Maekawa's Algorithm Raymond's Algorithm Ricart–Agrawala...

Mutual Exclusion Algorithm Ricart–Agrawala algorithm Raymond's algorithm "Maekawa's Mutual Exclusion Algorithm: Voting approach". "Distributed Mutual Exclusion"...

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor...

combinatorial game theory, there is a minimax algorithm for game solutions. A simple version of the minimax algorithm, stated below, deals with games such as...

Government by algorithm (also known as algorithmic regulation, regulation by algorithms, algorithmic governance, algocratic governance, algorithmic legal order...

The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants, is a method used for minimization of Boolean functions that was developed...

bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function successively generates...

This is further generalized by DNA sequence alignment algorithms such as the Smith–Waterman algorithm, which make an operation's cost depend on where it...

security. Quantum algorithms then emerged for solving oracle problems, such as Deutsch's algorithm in 1985, the Bernstein–Vazirani algorithm in 1993, and Simon's...

In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Best explored is functional correctness...

an algorithm is repeated and each run of the algorithm produces one Pareto optimal solution; Evolutionary algorithms where one run of the algorithm produces...

Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data. It was presented by...

Fisher, Michael J.; Fowler, Rob; Lynch, Nancy; Strong, H. Raymond (1982). "An Efficient Algorithm for Byzantine Agreement without Authentication". Information...

The Electronium, created by Raymond Scott, is an early combined electronic synthesizer and algorithmic composition / generative music machine. Its place...

simpler algorithms than in the general case. The simplest way to compute a maximum cardinality matching is to follow the Ford–Fulkerson algorithm. This...

The following timeline of algorithms outlines the development of algorithms (mainly "mathematical recipes") since their inception. Before – writing about...

system (sometimes replacing system with terms such as platform, engine, or algorithm), is a subclass of information filtering system that provides suggestions...

SAT. There is no known algorithm that efficiently solves each SAT problem, and it is generally believed that no such algorithm exists, but this belief...

such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory...

algebra and numerical analysis, the Gram–Schmidt process or Gram-Schmidt algorithm is a way of finding a set of two or more vectors that are perpendicular...

In algorithmic information theory, algorithmic probability, also known as Solomonoff probability, is a mathematical method of assigning a prior probability...

is, to undo ROT13, the same algorithm is applied, so the same action can be used for encoding and decoding. The algorithm provides virtually no cryptographic...

Universal Time (UTC).: 3  It uses the intersection algorithm, a modified version of Marzullo's algorithm, to select accurate time servers and is designed...

match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings, or for input validation...

developed an initial prototype of diff. The algorithm this paper described became known as the Hunt–Szymanski algorithm. McIlroy's work was preceded and influenced...

detection, the local outlier factor (LOF) is an algorithm proposed by Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng and Jörg Sander in 2000 for finding...

Griffiths have suggested the additive increase/multiplicative decrease algorithm as a solution to the Peter principle less severe than firing employees...