Library sort (2004)
AKS primality test (2002)
LZMA compression algorithm (2001)
the Hilltop algorithm (1999)
Yarrow algorithm (1999)
rsync algorithm (1998)
the Page Rank algorithm (1998)
RIPEMD-160 (1996)
Grover's algorithm (1996)
Bruun's algorithm (1996) was generalized to arbitrary even composite sizes by H. Murakami
Burrows-Wheeler transform (1994)
Shor's algorithm (1994)
Deutsch-Jozsa algorithm (1992)
Wait-free synchronization (1991)
combsort (1991)
General number field sieve (1990)
Special number field sieve (1988)
Fast multipole method (1987)
Blum Blum Shub (1986)
Simulated annealing (1985)
Karmarkar's interior-point algorithm (1984)
LZW algorithm (1984)
Lempel-Ziv (1984)
Simulated annealing (1983)
Quadratic sieve (1981)
Khachiyan's ellipsoid method (1979)
Bruun's algorithm (1978)
LZ78 algorithm (1978)
RSA security algorithm (1978)
Diffie-Hellman Security Algorithm (1977)
boyer moore algorithm (1977)
LZ77 algorithm (1977)
Boyer-Moore string search algorithm (1977)
Knuth-Morris-Pratt algorithm (1976)
Salamin-Brent algorithm (1976)
Aho-Corasick algorithm (1975)
Pollard's rho algorithm (1975)
Genetic algorithms (1975)
Pollard's p − 1 algorithm (1974)
Font Generation Algorithms (1973) were developed by Peter Karow in his program Ikarus
Jarvis march algorithm (1973)
RSA encryption algorithm (1973)
Graham scan (1972)
BFGS method of the quasi-Newton class (1970)
Knuth-Bendix completion algorithm (1970)
A* search algorithm (1968)
the Cooley-Tukey FFT algorithm (1965)
Viterbi algorithm (1967)
Dantzig algorithm (1966)
Cocke-Younger-Kasami (CYK) algorithm (1965)
Levenshtein distance (1965)
HeapSort (1964)
multigrid methods (1964)
Bresenham's line algorithm (1962)
Ford-Fulkerson algorithm (1962)
Quicksort (1960)
warshall's algorithm (1959)
De Casteljau's algorithm (1959)
Dijkstra's algorithm (1959)
shellsort (1959)
Prim's algorithm (1957)
Bellman-Ford algorithm (1957)
Prim's algorithm (1957)
Kruskal's algorithm (1956)
radix sort (1954)
Hashing (1953)
Huffman coding (1952)
Markov algorithms (1951)
Shannon-Fano coding (1948)
Simplex algorithm (1947)
mergesort (1945)
the Church-Turing thesis was first proposed by Stephen C. Kleene (1943) but named after Alonzo Church and Alan Turing
Alonzo Church used lambda calculus (1936)
to give a negative answer to the Entscheidungsproblem
Turing machines (1936) were described by Alan Turing
Delaunay triangulation (1934)
Gödel's incompleteness theorems (1931)
Entscheidungsproblem (1928)
Boruvka's algorithm (1926)
Maximum likelihood estimation (1922)
the FFT algorithm (1805) was invented by Carl Friedrich Gauss
Newton-Raphson method (1671)
John Napier's logarithms (1614)
Alexander De Villa Dei publishes Carmen de Algorismo (1220)
the Salem manuscript of the 12th century is one of the oldest in the West in
which computations are described with Indian numerals. The codex begins:
Incipit liber algorithmi
Al-Khwarizmi described an algorithm for solving Linear equations (early 9th century) and
Quadratic equations. The word algorithm comes from his name and was coined in the 18th century
the Sieve of Eratosthenes (200 bc)
the Euclidean algorithm (300 bc)