Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 44. Chapters: Donald Knuth, Robert Tarjan, Joseph F. Traub, David Mumford, Ingrid Daubechies, Steven Strogatz, J. Tinsley Oden, Richard A. Tapia, S. R. Srinivasa Varadhan, Peter Lax, Carl R. de Boor, Burton Wendroff, Richard M. Karp, Max Gunzburger, Thomas Kailath, Cathleen Synge Morawetz, Jerrold E. Marsden, James Sethian, Thomas J.R. Hughes, John Guckenheimer, Eduardo Daniel Sontag, Ronald Graham, Henk van der Vorst, Phillip Colella, John Hopcroft, Roger W. Brockett, Donald G. Saari, Richard P. Brent, Vladimir Rokhlin, Paul Garabedian, Nicholas Higham, Richard Askey, Gilbert Strang, Simon A. Levin, Roger Temam, Harold W. Kuhn, Douglas N. Arnold, John Bell, Cleve Moler, Michael Artin, Ivo Babu ka, Andrew Majda, J. Alan George, Jack Dongarra, Stanley Osher, Murray Rosenblatt, Joseph Keller, Charles F. Van Loan, Ian Sloan, Lloyd Nicholas Trefethen, Chi-Wang Shu, Shmuel Winograd, Harold J. Kushner, Michael Waterman, George Andrews, Harry Swinney, Israel Gohberg, F. Thomson Leighton, Alexandre Chorin, Avner Friedman, Arthur Jaffe, Charles S. Peskin, Grace Wahba, John Ockendon, James Glimm, Eva Tardos, George C. Papanicolaou, Constantine Dafermos, Philippe G. Ciarlet, Roland Glowinski, Achi Brandt, Andrew M. Stuart, David S. Johnson, Paul Rabinowitz, Margaret H. Wright. Excerpt: Donald Ervin Knuth (; born January 10, 1938) is a computer scientist and Professor Emeritus at Stanford University. He is the author of the seminal multi-volume work The Art of Computer Programming. Knuth has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical co...