Timeline of Algorithms - 1970s

1970s

• 1970 - Knuth–Bendix completion algorithm developed by Donald Knuth and Peter B. Bendix
• 1970 - BFGS method of the quasi-Newton class
• 1972 - Graham scan developed by Ronald Graham
• 1972 - Red-black trees and B-trees discovered
• 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 string matching 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
• 1977 - multigrid methods developed independently by Achi Brandt and Wolfgang Hackbusch
• 1978 - LZ78 algorithm developed from LZ77 by Abraham Lempel and Jacob Ziv
• 1978 - Bruun's algorithm proposed for powers of two by Georg Bruun
• 1979 - Khachiyan's ellipsoid method developed by Leonid Khachiyan
• 1979 - ID3 decision tree algorithm developed by Ross Quinlan