Who developed the first algorithms?
Timeline of algorithms
1990 – General number field sieve developed from SNFS by Carl Pomerance, Joe Buhler, Hendrik Lenstra, and Leonard Adleman
1991 – Wait-free synchronization developed by Maurice Herlihy
1992 – Deutsch–Jozsa algorithm proposed by D. Deutsch and Richard Jozsa
1992 – C4.5 algorithm, a descendent of ID3 decision tree algorithm, was developed by Ross Quinlan
1993 – Apriori algorithm developed by Rakesh Agrawal and Ramakrishnan Srikant
1993 – Karger's algorithm to compute the minimum cut of a connected graph by David Karger
1994 – Shor's algorithm developed by Peter Shor
1994 – Burrows–Wheeler transform developed by Michael Burrows and David Wheeler
1994 – Bootstrap aggregating (bagging) developed by Leo Breiman
1995 – AdaBoost algorithm, the first practical boosting algorithm, was introduced by Yoav Freund and Robert Schapire
1995 – soft-margin support vector machine algorithm was published by Vladimir Vapnik and Corinna Cortes. It adds a soft-margin idea to the 1992 algorithm by Boser, Nguyon, Vapnik, and is the algorithm that people usually refer to when saying SVM
1995 – Ukkonen's algorithm for construction of suffix trees
1996 – Bruun's algorithm generalized to arbitrary even composite sizes by H. Murakami
1996 – Grover's algorithm developed by Lov K. Grover
1996 – RIPEMD-160 developed by Hans Dobbertin, Antoon Bosselaers, and Bart Preneel
1997 – Mersenne Twister a pseudo random number generator developed by Makoto Matsumoto and Tajuki Nishimura
1998 – PageRank algorithm was published by Larry Page
1998 – rsync algorithm developed by Andrew Tridgell
1999 – gradient boosting algorithm developed by Jerome H. Friedman
1999 – Yarrow algorithm designed by Bruce Schneier, John Kelsey, and Niels Ferguson