Editing Timeline of algorithms (section)

==1950s==
* 1950 – [[Hamming code|Hamming codes]] developed by [[Richard Hamming]] 
* 1952 – [[Huffman coding]] developed by [[David A. Huffman]]
* 1953 – [[Simulated annealing]] introduced by [[Nicholas Metropolis]]
* 1954 – [[Radix sort]] computer algorithm developed by [[Harold H. Seward]]
* 1964 – [[Box–Muller transform]] for fast generation of normally distributed numbers published by [[George Edward Pelham Box]] and [[Mervin Edgar Muller]]. Independently pre-discovered by [[Raymond E. A. C. Paley]] and [[Norbert Wiener]] in 1934.
* 1956 – [[Kruskal's algorithm]] developed by [[Joseph Kruskal]]
* 1956 – [[Ford–Fulkerson algorithm]] developed and published by [[R. Ford Jr.]] and [[D. R. Fulkerson]]
* 1957 – [[Prim's algorithm]] developed by [[Robert Prim]]
* 1957 – [[Bellman–Ford algorithm]] developed by [[Richard E. Bellman]] and [[L. R. Ford, Jr.]]
* 1959 – [[Dijkstra's algorithm]] developed by [[Edsger Dijkstra]]
* 1959 – [[Shell sort]] developed by [[Donald L. Shell]]
* 1959 – [[De Casteljau's algorithm]] developed by [[Paul de Casteljau]]
* 1959 – [[QR factorization]] [[QR algorithm|algorithm]] developed independently by [[John G.F. Francis]] and [[Vera Kublanovskaya]]<ref>{{cite journal | last1 = Francis | first1 = J.G.F. | year = 1961 | title = The QR Transformation, I | journal = The Computer Journal | volume = 4 | issue = 3| pages = 265–271 | doi=10.1093/comjnl/4.3.265| doi-access = free }}</ref><ref>{{cite journal | last1 = Kublanovskaya | first1 = Vera N. | year = 1961 | title = On some algorithms for the solution of the complete eigenvalue problem | journal = USSR Computational Mathematics and Mathematical Physics | volume = 1 | issue = 3| pages = 637–657 | doi = 10.1016/0041-5553(63)90168-X }} Also published in: Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki [Journal of Computational Mathematics and Mathematical Physics], 1(4), pages 555–570 (1961).</ref>
* 1959 – [[Powerset construction|Rabin–Scott powerset construction]] for converting [[Nondeterministic finite automaton|NFA]] into [[Deterministic finite automaton|DFA]] published by [[Michael O. Rabin]] and [[Dana Scott]]