Suggested Papers for the Top Ten Algorithms

• John Backus,
  The history of Fortran I, II and III,
  ACM SIGPLAN Notices,
  Volume 13, Number 8, pages 165-180, August 1978.
• David Bailey,
  Integer Relation Detection,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 24-28.
• Rick Beatson, Leslie Greengard,
  A short course on fast multipole methods.
• Isabel Beichl, Francis Sullivan,
  The Metropolis Algorithm,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 65-69.
• Burton Bloom,
  Space-time Tradeoffs in Hash Coding with Allowable Errors,
  Communications of the ACM,
  Volume 13, Number 7, July 1970, pages 422-426.
• John Board, Klaus Schulten,
  The Fast Multipole Algorithm,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 76-79.
• Paul Bourke,
  DFT (Discrete Fourier Transform) and FFT (Fast Fourier Transform)
• Siddhartha Chib, Edward Greenberg,
  Understanding the Metropolis-Hastings Algorithm,
  The American Statistician,
  Volume 49, Number 4, November 1995, pages 327-335.
• Barry Cipra,
  The Best of the 20th Century: Editors Name Top 10 Algorithms,
  SIAM News,
  Volume 33, Number 4, May 16, 2000, page 1,
  https://www.siam.org/pdf/news/637.pdf
• Alexander Dewdney,
  The Turing Omnibus,
  Freeman, 1989,
  ISBN13: 9780716781547,
  LC: QA76.D45.
• Ken Dill, Justin MacCallum,
  The Protein-Folding Problem, 50 Years On,
  Science,
  Volume 338, 23 November 2012, pages 1042-1047.
• Jack Dongarra, Francis Sullivan,
  The Top Ten Algorithms of the Century,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 22-23.
• George Dvorsky,
  The Ten Algorithms That Dominate Our World,
  http://io9.com/the-10-algorithms-that-dominate-our-world-1580110464
• Richard Elwes,
  The algorithm that runs the world,
  New Scientist,
  13 August 2012.
• Peteris Erins,
  The Ten Algorithms Every Computer Science Student Must Implement At Least Once in Their Life.
• Thomas Ferguson,
  Linear Programming: A Concise Introduction.
• Dan Givoli,
  The Top 10 Computational Methods of the 20th Century,
  IACM Expressions,
  Number 11, September 2001, pages 5-9.
• David Gleich,
  PageRank Beyond the Web,
  SIAM Review,
  Volume 57, Number 3, 2015, pages 321-363.
• Martin Gutknecht,
  A Brief Introduction to Krylov Space Methods for Solving Linear Systems.
• Tony Hoare,
  Quicksort,
  Computer Journal,
  Volume 5, Number 1, 1962, pages 10-16.
• Joseph Jaja,
  A Perspective on Quicksort,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 43-49.
• James Keener,
  The Perron-Frobenius Theorem and the Ranking of Football Teams,
  SIAM Review,
  Volume 35, Number 1, pages 80-93, March 1993.
• Steve Lohr,
  In case you wondered, a real human wrote this column,
  The New York Times,
  September 10, 2011.
• John MacCormick,
  Nine Algorithms That Changed the Future: The Ingenious Ideas that Drive Today's Computers,
  Princeton University Press,
  ISBN-13: 978-0691158198.
• Andrew McGregor,
  Linear Sketches (slides).
• L. F. Menabrea, notes by Ada Lovelace,
  Sketch of the Analytical Engine invented by Charles Babbage,
  1842.
• Cleve Moler,
  Experiments with Matlab,
  Chapter 7: Google PageRank
  https://www.mathworks.com/moler/exm/chapters/pagerank.pdf
• Muthu Muthukrishnan,
  Data Streams: Algorithms and Applications
• John Nash,
  The (Dantzig) Simplex Method for Linear Programming,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 29-31.
• Albert Nijenhuis, Herbert Wilf,
  Combinatorial Algorithms for Computers and Calculators,
  Second Edition,
  Academic Press, 1978,
  ISBN: 0-12-519260-6,
  LC: QA164.N54.
• Marcos Otero,
  The Real Top 10 Algorithms That Dominate Our World,
  https://medium.com/@_marcos_otero/the-real-10-algorithms-that-dominate-our-world-e95fa9f16c04
• David Padua,
  The Fortran I Compiler,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 70-75.
• Beresford Parlett,
  The QR Algorithm,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 38-42.
• Sara Robinson,
  Computer Scientists Find Unexpected Depths in Airfare Search Problem,
  SIAM News,
  Volume 35, Number 6, July/August 2002.
• Daniel Rockmore,
  The FFT: An Algorithm the Whole Family Can Use,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 60-64.
• Alvin Roth, Elliott Peranson,
  Design of the matching market for American physicians: the engineering aspects of economic design,
  The American Economic Review,
  Volume 89, Number 4, pages 748-780, September 1999.
• Jason Sachs,
  Bad hash functions and other stories: Trapped in a cage of irresponsibility and garden rakes,
  http://www.embeddedrelated.com/showarticle/535.php
• SCRIPTOL,
  List of algorithms,
  http://www.scriptol.com/programming/list-algorithms.php
• Steven Skiena,
  The Algorithm Design Manual,
  Springer, 2008,
  ISBN-13: 978-1-84800-069-8,
  LC: QA76.9.A43S55.
• G W Stewart,
  The Decompositional Approach to Matrix Computation,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 50-59.
• Ian Stewart,
  In Pursuit of the Unknown: 17 Equations that Changed the World,
  Basic Books,
  ISBN-13: 978-0465085989
• Armin Straub,
  A gentle introduction to PSLQ
• Henk van der Vorst,
  Krylov Subspace Iteration,
  Computing in Science and Engineering,
  Volume 2, Number 1, January/February 2000, pages 32-37.
• David Watkins,
  The QR Algorithm Revisited,
  SIAM Review,
  Volume 50, Number 1, 2008, pages 133-145.
• Xindong Wu, Vipin Kumar, J Ross Quinlan, Joydeep Ghosh, Qiang Yang, Hiroshi Motoda, Geoffrey McLachlan, Angus Ng, Bing Lu, Philip Yu, Zhi-Hua Zhou, Michael Steinbach, David Hand, Dan Steinberg,
  Top 10 algorithms in data mining,
  Knowledge and Information Systems,
  Volume 14, Number 1, January 2008, pages 1-37.