Editing Timeline of algorithms (section)

==1970s==
* 1970 – [[Dinic's algorithm]] for computing maximum flow in a flow network by Yefim (Chaim) A. Dinitz
* 1970 – [[Knuth–Bendix completion algorithm]] developed by [[Donald Knuth]] and [[Peter B. Bendix]]
* 1970 – [[BFGS method]] of the [[Quasi-Newton method|quasi-Newton]] class
* 1970 – [[Needleman–Wunsch algorithm]] published by [[Saul B. Needleman]] and [[Christian D. Wunsch]]
* 1972 – [[Edmonds–Karp algorithm]] published by [[Jack Edmonds]] and [[Richard Karp]], essentially identical to [[Dinic's algorithm]] from 1970
* 1972 – [[Graham scan]] developed by [[Ronald Graham]]
* 1972 – [[Red–black tree]]s and [[B-tree]]s discovered
* 1973 – [[RSA (algorithm)|RSA]] encryption algorithm discovered by [[Clifford Cocks]]
* 1973 – [[Jarvis march]] algorithm developed by [[R. A. Jarvis]]
* 1973 – [[Hopcroft–Karp algorithm]] developed by [[John Hopcroft]] and [[Richard Karp]]
* 1974 – [[Pollard's p − 1 algorithm|Pollard's ''p''&nbsp;−&nbsp;1 algorithm]] developed by [[John Pollard (mathematician)|John Pollard]]
* 1974 – [[Quadtree]] developed by [[Raphael Finkel]] and [[J.L. Bentley]]
* 1975 – [[Genetic algorithm]]s popularized by [[John Henry Holland|John Holland]]
* 1975 – [[Pollard's rho algorithm]] developed by [[John Pollard (mathematician)|John Pollard]]
* 1975 – [[Aho–Corasick string matching algorithm]] developed by [[Alfred V. Aho]] and [[Margaret J. Corasick]]
* 1975 – [[Cylindrical algebraic decomposition]] developed by [[George E. Collins]]
* 1976 – [[Salamin–Brent algorithm]] independently discovered by [[Eugene Salamin (mathematician)|Eugene Salamin]] and [[Richard Brent (scientist)|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 (algorithm)|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 FFT algorithm|Bruun's algorithm]] proposed for powers of two by [[Georg Bruun]]
* 1979 – Khachiyan's [[ellipsoid method]] developed by [[Leonid Khachiyan]]
* 1979 – [[ID3 algorithm|ID3]] decision tree algorithm developed by [[Ross Quinlan]]