Editing Timeline of algorithms (section)

==1980s==
* 1980 – [[Cycle detection#Brent.27s algorithm|Brent's Algorithm]] for cycle detection [[Richard P. Brent|Richard P. Brendt]]
* 1981 – [[Quadratic sieve]] developed by [[Carl Pomerance]]
* 1981 – [[Smith–Waterman algorithm]] developed by [[Temple F. Smith]] and [[Michael S. Waterman]]
* 1983 – [[Simulated annealing]] developed by [[S. Kirkpatrick]], [[C. D. Gelatt]] and [[M. P. Vecchi]]
* 1983 – [[Classification and regression tree]] (CART) algorithm developed by [[Leo Breiman]], ''et al.''
* 1984 – [[Lempel–Ziv–Welch|LZW]] algorithm developed from [[LZ78]] by [[Terry Welch]]
* 1984 – [[Karmarkar's interior-point algorithm]] developed by [[Narendra Karmarkar]]
* 1984 – [[ACORN PRNG]] discovered by Roy Wikramaratna and used privately 
* 1985 – [[Simulated annealing]] independently developed by [[V. Cerny]]
* 1985 – [[Car–Parrinello molecular dynamics]] developed by [[Roberto Car]] and [[Michele Parrinello]]
* 1985 – [[Splay tree]]s discovered by [[Daniel Dominic Sleator|Sleator]] and [[Robert Endre Tarjan|Tarjan]]
* 1986 – [[Blum Blum Shub]] proposed by [[Lenore Blum|L. Blum]], [[Manuel Blum|M. Blum]], and [[Michael Shub|M. Shub]]
* 1986 – [[Push–relabel maximum flow algorithm|Push relabel maximum flow algorithm]] by Andrew Goldberg and Robert Tarjan
* 1986 – [[Barnes–Hut simulation|Barnes–Hut tree method]] developed by [[Josh Barnes]] and [[Piet Hut]] for fast approximate simulation of [[n-body problem]]s
* 1987 – [[Fast multipole method]] developed by [[Leslie Greengard]] and [[Vladimir Rokhlin (American scientist)|Vladimir Rokhlin]]
* 1988 – [[Special number field sieve]] developed by [[John Pollard (mathematician)|John Pollard]]
* 1989 – [[ACORN PRNG]] published by Roy Wikramaratna
* 1989 – [[Paxos (computer science)|Paxos protocol]] developed by [[Leslie Lamport]]
* 1989 – [[Skip list]] discovered by [[William Pugh (computer_scientist)|William Pugh]]