Unlike Deutsch's Algorithm, this algorithm required two function evaluations instead of only one.

The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990.

The Risch Algorithm shows that Ei is not an elementary function.

The MD2 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1989.

Again the estimated population variance of 30 is computed correctly by Algorithm II, but the naive algorithm now computes it as − 170. 66666666666666.

Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem.

The reference model given by the ITU-T and ATM Forum for UPC and NPC is the Generic Cell Rate Algorithm ( GCRA ), which is a version of the leaky bucket algorithm.

* C implementation of Flood / Seed Fill Algorithm from Graphics Gems ; BSD ( ish ) license, by Paul Heckbert.

In cryptography, the International Data Encryption Algorithm ( IDEA ) is a block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991.

* Differential Search Algorithm ( DS ) inspired by migration of superorganisms.

* A Genetic Algorithm Tutorial by Darrell Whitley Computer Science Department Colorado State University An excellent tutorial with lots of theory

At Stanford, he was supervised by Robert Floyd and Donald Knuth, both highly prominent computer scientists, and his Ph. D. dissertation was An Efficient Planarity Algorithm.

* " The Bresenham Line-Drawing Algorithm ", by Colin Flanagan

* Line Thickening by Modification To Bresenham's Algorithm, A. S. Murphy, IBM Technical Disclosure Bulletin, Vol.

* The Bresenham Line-Drawing Algorithm by Colin Flanagan

* An Explanation of the Deflate Algorithm by Antaeus Feldspar.

Such ideas range from the psychological-cognitive, such as Osborn-Parnes Creative Problem Solving Process, Synectics, Science-based creative thinking, Purdue Creative Thinking Program, and Edward de Bono's lateral thinking ; to the highly structured, such as TRIZ ( the Theory of Inventive Problem-Solving ) and its variant Algorithm of Inventive Problem Solving ( developed by the Russian scientist Genrich Altshuller ), and Computer-Aided Morphological analysis.

Algorithm generating mesh is driven by the parameters.

The breakthrough was found by Morwen Thistlethwaite ; details of Thistlethwaite's Algorithm were published in Scientific American in 1981 by Douglas Hofstadter.

This modification was devised by A. M. Andrew and is known as Andrew's Monotone Chain Algorithm.

* The Expectation Maximization Algorithm: A short tutorial, A self contained derivation of the EM Algorithm by Sean Borman.

* The EM Algorithm, by Xiaojin Zhu.

The Deutsch – Jozsa Algorithm generalizes earlier ( 1985 ) work by David Deutsch, which provided a solution for the simple case.

::: ECDSA ( ANSI X9. 62 ) ( Elliptic Curve Digital Signature Algorithm ; ANSI X9. 62, SEC1 by Standards for Efficient Cryptography Group-2000 )

The latter scheme became the basis for Digital Signature Algorithm ( DSA ) adopted by National Institute of Standards and Technology ( NIST ) as the Digital Signature Standard ( DSS ).

: For a detailed presentation of the various points of view around the definition of " algorithm " see Algorithm characterizations.

: For an example of the simple algorithm " Add m + n " described in all three levels see Algorithm examples.

While this loss of precision may be tolerable and viewed as a minor flaw of Algorithm I, it is easy to find data that reveal a major flaw in the naive algorithm: Take the sample to be ( 10 < sup > 9 </ sup > + 4, 10 < sup > 9 </ sup > + 7, 10 < sup > 9 </ sup > + 13, 10 < sup > 9 </ sup > + 16 ).

This is a serious problem with Algorithm I and is due to catastrophic cancellation in the subtraction of two similar numbers at the final stage of the algorithm.

* Artificial Bee Colony Algorithm, a search algorithm used for optimizing multi-variable and multi-modal numerical functions

* UCData: " Pretty Good Bidi Algorithm Library " A small and fast bidirectional reordering algorithm that works pretty good, but not necessarily compliant to the Unicode algorithm

( membership problem is even polynomially decidable-see CYK algorithm and Earley's Algorithm )

Parser algorithms for context-free languages include the CYK algorithm and the Earley's Algorithm.

A standard algorithm for collating any collection of strings composed of any standard Unicode symbols is the Unicode Collation Algorithm.

Some documentation makes a distinction between DES as a standard and DES as an algorithm, referring to the algorithm as the DEA ( Data Encryption Algorithm ).

* COmponent Detection Algorithm, a mass spectrometry and chemometrics software algorithm

In cryptography, Triple DES is the common name for the Triple Data Encryption Algorithm ( TDEA or Triple DEA ) block cipher, which applies the Data Encryption Standard ( DES ) cipher algorithm three times to each data block.

The earliest standard that defines the algorithm ( ANS X9. 52, published in 1998 ) describes it as the " Triple Data Encryption Algorithm ( TDEA )" — i. e. three operations of the Data Encryption Algorithm specified in ANSI X3. 92 — and does not use the terms " Triple DES " or " DES " at all.

The paper proposing the Source Node Condition and the Diffusing Update Algorithm algorithm itself can be found here.

* Deducting Search Algorithm, mathematical algorithm to determine shortest route to information

we can then apply a straightforward algorithm ( Matsui's Algorithm 2 ), using known plaintext-ciphertext pairs, to guess at the values of the key bits involved in the approximation.

* AC-3 algorithm ( Arc Consistency Algorithm 3 ), one of a series of algorithms used for the solution of constraint satisfaction problems

* Data Encryption Algorithm, the block cipher algorithm defined in ( and often referred to as ) the Data Encryption Standard