Timeline of algorithms

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

[edit] Before 1940

Before - Writing about "recipes" (on cooking, rituals, agriculture and other themes)
C. 1600 BC - Babylonians develop earliest known algorithms for factorization and finding square roots
C. 300 BC - Euclid's algorithm
C. 200 BC - the Sieve of Eratosthenes
263 - Gaussian elimination described by Liu Hui
Between 813 and 833 Al-Khawarizmi described an algorithm for solving Linear equations and Quadratic equations; the word algorithm comes from his name
1614 - John Napier develops method for performing calculations using logarithms
1671 - Newton-Raphson method developed by Isaac Newton
1690 - Newton-Raphson method independently developed by Joseph Raphson
1805 - FFT-like algorithm known by Carl Friedrich Gauss
1926 - Boruvka's algorithm
1934 - Delaunay triangulation developed by Boris Delaunay
1936 - Turing machine, an abstract machine developed by Alan Turing, with others developed the modern notion of algorithm.

1970 - Knuth-Bendix completion algorithm developed by Donald Knuth and P. B. Bendix
1970 - BFGS method of the quasi-Newton class
1972 - Graham scan developed by Ronald Graham
1973 - RSA encryption algorithm discovered by Clifford Cocks
1973 - Jarvis march algorithm developed by R. A. Jarvis
1974 - Pollard's p-1 algorithm developed by John Pollard
1975 - Genetic algorithms popularized by John Holland
1975 - Pollard's rho algorithm developed by John Pollard
1975 - Aho-Corasick algorithm developed by Alfred V. Aho and Margaret J. Corasick
1976 - Salamin-Brent algorithm independently discovered by Eugene Salamin and Richard Brent
1976 - Knuth-Morris-Pratt algorithm developed by Donald Knuth and Vaughan Pratt and independently by J. H. Morris
1977 - Boyer-Moore string search algorithm for searching the occurrence of a string into another string.
1977 - RSA encryption algorithm rediscovered by Ron Rivest, Adi Shamir, and Len Adleman
1977 - LZ77 algorithm developed by Abraham Lempel and Jacob Ziv
1978 - LZ78 algorithm developed from LZ77 by Abraham Lempel and Jacob Ziv
1978 - Bruun's algorithm proposed for powers of two by G. Bruun
1979 - Khachiyan's ellipsoid method developed by Leonid Khachiyan

1981 - Quadratic sieve developed by Carl Pomerance
1983 - Simulated annealing developed by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi
1984 - LZW algorithm developed from LZ78 by Terry Welch
1984 - Karmarkar's interior-point algorithm developed by Narendra Karmarkar
1985 - Simulated annealing independently developed by V. Cerny
1986 - Blum Blum Shub proposed by L. Blum, M. Blum, and M. Shub
1988 - Special number field sieve developed by John Pollard