Knuth, Donald Ervin 1938Overview
Publication Timeline
Most widely held works about
Donald Ervin Knuth
more
fewer
Most widely held works by
Donald Ervin Knuth
The art of computer programming
by Donald Ervin Knuth
(
Book
)
298 editions published between 1968 and 2014 in 3 languages and held by 4,861 WorldCat member libraries worldwide Knuth's multivolume work is widely recognized as the definitive description of classical computer science: at the end of 1999, these books were named among the best twelve physicalscience monographs of the century by American Scientist. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their daytoday problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Cover
Concrete mathematics : a foundation for computer science
by Ronald L Graham
(
Book
)
81 editions published between 1988 and 2012 in English and Undetermined and held by 1,776 WorldCat member libraries worldwide
The TeXbook
by Donald Ervin Knuth
(
Book
)
126 editions published between 1953 and 2012 in English and Undetermined and held by 1,356 WorldCat member libraries worldwide Computing Methodologies  Text Processing
Mathematics for the analysis of algorithms
by Daniel H Greene
(
Book
)
43 editions published between 1981 and 2008 in English and German and held by 1,102 WorldCat member libraries worldwide "A quantitative study of the efficiency of computer methods requires an indepth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford."Publisher's website
Surreal numbers : how two exstudents turned on to pure mathematics and found total happiness : a mathematical novelette
by Donald Ervin Knuth
(
Book
)
20 editions published between 1974 and 2011 in English and Undetermined and held by 712 WorldCat member libraries worldwide
Mathematical writing
by Donald Ervin Knuth
(
Book
)
19 editions published between 1988 and 1996 in English and Undetermined and held by 641 WorldCat member libraries worldwide
The METAFONTbook
by Donald Ervin Knuth
(
Book
)
44 editions published between 1953 and 2012 in English and held by 605 WorldCat member libraries worldwide Computing Methodologies  Text Processing
The art of computer programming
by Donald Ervin Knuth
(
Book
)
97 editions published between 1968 and 2013 in 4 languages and held by 594 WorldCat member libraries worldwide Donald Knuth is Professor Emeritus of the Art of Computer Programming at Stanford University, and is wellknown worldwide as the creator of the Tex typesetting language. Here he presents the second volume of his guide to computer programming
TEX : the program
by Donald Ervin Knuth
(
Book
)
46 editions published between 1983 and 2012 in English and Undetermined and held by 560 WorldCat member libraries worldwide Volume B
The Stanford GraphBase : a platform for combinatorial computing
by Donald Ervin Knuth
(
Book
)
23 editions published between 1993 and 2009 in English and held by 464 WorldCat member libraries worldwide The Stanford GraphBase: A Platform for Combinatorial Computing represents the first fruits of Donald E. Knuth's preparation for Volume 4 of The Art of Computer Programming. The book's first goal is to demonstrate, through about 30 examples, the art of literate programming. Each example is a programmatic essay, a short story that can be read and enjoyed by human beings as readily as it can be read and interpreted by machines. In these essays/programs, Knuth makes new contributions to the exposition of several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard freely available sets of data  the Stanford GraphBase  that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests here made possible, Knuth hopes to bridge the gap between theoretical computer scientists and programmers' who have real problems to solve. As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work, in which he invites us to participate. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides demonstration programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost exhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better
A=B
by Marko Petkovšek
(
Book
)
2 editions published in 1996 in English and held by 455 WorldCat member libraries worldwide In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks
Computer modern typefaces
by Donald Ervin Knuth
(
Book
)
29 editions published between 1986 and 2000 in 3 languages and held by 443 WorldCat member libraries worldwide Volume E
METAFONT : the program
by Donald Ervin Knuth
(
Book
)
29 editions published between 1953 and 2000 in English and held by 439 WorldCat member libraries worldwide Volume D
Axioms and hulls
by Donald Ervin Knuth
(
Book
)
19 editions published in 1992 in English and held by 438 WorldCat member libraries worldwide "One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed counterclockwise when we encounter the points in cyclic order p, q, r, p,...; and the incircle relation pqrs, which states that s lies inside that circle if pqr is true, or outside that circle if pqr is false. The author, Donald Knuth, is one of the greatest computer scientists of our time. A few years ago, he and some of his students were looking at amap that pinpointed the locations of about 100 cities. They asked, "Which ofthese cities are neighbors of each other?" They knew intuitively that some pairs of cities were neighbors and some were not; they wanted to find a formal mathematical characterization that would match their intuition.This monograph is the result."PUBLISHER'S WEBSITE
TEX and METAFONT : new directions in typesetting
by Donald Ervin Knuth
(
Book
)
13 editions published in 1979 in English and held by 434 WorldCat member libraries worldwide
MMIXware : a RISC computer for the third millennium
by Donald Ervin Knuth
(
Book
)
22 editions published between 1999 and 2000 in English and held by 417 WorldCat member libraries worldwide "This book is a collection of programs written in CWEB that make MMIX a virtual reality. Among other utilities, an assembler converting MMIX symbolic files to MMIX objects and two simulators executing the programs in given object files are provided. Of particular interest is the MMMIX metasimulator, which is able to do dynamic scheduling of a complex pipeline, allowing superscalar execution with any number of functional units and with many varieties of caching and branch prediction, etc., including a detailed implementation of both hard and soft interrupts."
Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 1622, 1979
by A. P Ershov
(
Book
)
12 editions published in 1981 in 3 languages and held by 401 WorldCat member libraries worldwide
Literate programming
by Donald Ervin Knuth
(
Book
)
18 editions published between 1982 and 2001 in English and Undetermined and held by 382 WorldCat member libraries worldwide This anthology of essays from Donald Knuth, the inventor of literate programming includes early essays on related topics such as structured programming, as well as The Computer Journal article that launched literate programming itself. Many examples are given, including excerpts from the programs for TeX and METAFONT. The final essay is an example of CWEB, a system for literate programming in C and related languages.Knuth feels that computer programs and books about computer programming should be interesting, entertaining, and literate. Thirteen of Knuth's most interesting essays are collected here, including the Computer Journal article that launched literate programming. Although most of the examples are in either Pascal or ALGOL 60, C programmers and others will still benefit from the material. The last essay describes CWEB, a system for literate programming in C and related languages. Highly recommended for all programmers and wouldbe programmers
Things a computer scientist rarely talks about
by Donald Ervin Knuth
(
Book
)
9 editions published between 2001 and 2002 in English and held by 377 WorldCat member libraries worldwide How does a computer scientist understand infinity? What can probability theory teach us about free will? This book contains six informal lectures by computer scientist Donald E. Knuth exploring the relationship between his vocation and his faith
Selected papers on computer science
by Donald Ervin Knuth
(
Book
)
13 editions published between 1996 and 2004 in English and held by 373 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Algorithms Combinations Combinatorial analysis Combinatorial analysisData processing Combinatorial identitiesData processing Computer algorithms Computer architecture Computer graphics Computerized typesetting Computer network architectures Computer programming Computer programs Computers Computers and civilization Computer science Computer scienceMathematics ComputersMoral and ethical aspects Computer software Convex polytopes Font editors Geometry Information storage and retrieval systems Knuth, Donald Ervin, Logic, Symbolic and mathematical Mathematics MathematicsAuthorship Mathematics printing Mathematics printingComputer programs Matroids METAFONT Number concept Number theory Printing Programming (Mathematics) Reduced instruction set computers Religion and science SciencePhilosophy Software engineering Sorting (Electronic computers) Stanford GraphBase Stanford University.Computer Science Department Structured programming Surreal numbers Technical writing Technical writingStudy and teaching TeX (Computer file) Type and typefoundingData processing Typesetting Universities and collegesFaculty WEB (Computer program language)

Alternative Names
Ervin Knuth Donald
Knut, D.
Knut, D. 1938
Knut, E.
Knuth, D.
Knuth, D. 1938
Knuth, D. (Donald), 1938
Knuth, D. E.
Knuth, D. E. 1938
Knuth, Don 1938
Knuth, Donald
Knuth, Donald 1938
Knuth, Donald E.
Knuth, Donald E. 1938
Knuth, Donald Ervin
Knuth, Donalʹd Ėrvin 1938
Kunūsu, Donarudo E. 1938
Кнут, Д 1938
Кнут, Дональд Э 1938
クヌース, ドナルド・E
Languages
Covers
