Knuth, Donald Ervin 1938
Overview
Works:  574 works in 3,131 publications in 7 languages and 27,602 library holdings 

Genres:  Conference papers and proceedings Terminology Interviews History Biographies 
Roles:  Author, Editor, Other, htt, Creator, Contributor, Honoree, Author of introduction, Translator, Type designer, Dedicatee 
Classifications:  QA76.6, 686.22544 
Publication Timeline
.
Most widely held works about
Donald Ervin Knuth
 The Essential knuth by Donald Ervin Knuth( Book )
 John McCarthy papers by John McCarthy( )
 Computer Science at Stanford ; the impact of the first ten years : by Stanford University( )
 George Polya papers by George Pólya( )
 Martin Gardner papers by Martin Gardner( )
 Knuth par Knuth : conversations avec Dikran Karagueuzian by Donald Ervin Knuth( Book )
 The living legends: a discussion about the establishment of the Computer Science Department at Stanford University :( )
 System Development Foundation records by Calif.) System Development Foundation (Palo Alto( )
 Stanford University, Euler Project, records by Stanford University( )
 Oral history interview with Donald E. Knuth by Donald Ervin Knuth( Book )
 Robert W. Floyd papers by Robert W Floyd( )
 Donald E. Knuth papers by Donald Ervin Knuth( )
 Richard Southall papers by Richard Southall( )
 by John McCarthy( )
 by Robert W Floyd( )
 by Stanford University( )
more
fewer
Most widely held works by
Donald Ervin Knuth
The art of computer programming by
Donald Ervin Knuth(
Book
)
190 editions published between 1968 and 2019 in English and Undetermined and held by 4,131 WorldCat member libraries worldwide
The third volume comprises the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories
190 editions published between 1968 and 2019 in English and Undetermined and held by 4,131 WorldCat member libraries worldwide
The third volume comprises the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories
Concrete mathematics : a foundation for computer science by
Ronald L Graham(
Book
)
94 editions published between 1988 and 2020 in English and Undetermined and held by 1,988 WorldCat member libraries worldwide
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its wellknown authors is to provide a solid and relevant base of mathematical skills  the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists  the authors themselves rely heavily on it!  but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for selfstudy. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them
94 editions published between 1988 and 2020 in English and Undetermined and held by 1,988 WorldCat member libraries worldwide
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its wellknown authors is to provide a solid and relevant base of mathematical skills  the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists  the authors themselves rely heavily on it!  but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for selfstudy. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them
The TeXbook by
Donald Ervin Knuth(
Book
)
154 editions published between 1953 and 2012 in English and held by 1,380 WorldCat member libraries worldwide
Computing Methodologies  Text Processing
154 editions published between 1953 and 2012 in English and held by 1,380 WorldCat member libraries worldwide
Computing Methodologies  Text Processing
Mathematics for the analysis of algorithms by
Daniel H Greene(
Book
)
44 editions published between 1981 and 2010 in English and German and held by 1,122 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
44 editions published between 1981 and 2010 in English and German and held by 1,122 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
The art of computer programming by
Donald Ervin Knuth(
Book
)
148 editions published between 1969 and 2014 in 4 languages and held by 963 WorldCat member libraries worldwide
The first revision of this third volume is the most comprehensive survey of computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and a new discussion of the theory of permutations and of universal hashing
148 editions published between 1969 and 2014 in 4 languages and held by 963 WorldCat member libraries worldwide
The first revision of this third volume is the most comprehensive survey of computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and a new discussion of the theory of permutations and of universal hashing
The art of computer programming by
Donald Ervin Knuth(
Book
)
145 editions published between 1968 and 2015 in 4 languages and held by 956 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
145 editions published between 1968 and 2015 in 4 languages and held by 956 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
Leaders in computing : changing the digital world by
Donald Ervin Knuth(
)
6 editions published in 2011 in English and held by 747 WorldCat member libraries worldwide
Annotation
6 editions published in 2011 in English and held by 747 WorldCat member libraries worldwide
Annotation
Surreal numbers : how two exstudents turned on to pure mathematics and found total happiness : a mathematical novelette by
Donald Ervin Knuth(
Book
)
29 editions published between 1974 and 2011 in English and Undetermined and held by 723 WorldCat member libraries worldwide
29 editions published between 1974 and 2011 in English and Undetermined and held by 723 WorldCat member libraries worldwide
The art of computer programming by
Donald Ervin Knuth(
Book
)
166 editions published between 1968 and 2014 in English and German and held by 686 WorldCat member libraries worldwide
The bible of programming theory and practice is being updated for the first time in more than 20 years. The book is concerned with information structuresthe representation of information within a computer, the structural interrelations between data elements and how to work with them efficiently, and applications to simulation, numerical methods and software design
166 editions published between 1968 and 2014 in English and German and held by 686 WorldCat member libraries worldwide
The bible of programming theory and practice is being updated for the first time in more than 20 years. The book is concerned with information structuresthe representation of information within a computer, the structural interrelations between data elements and how to work with them efficiently, and applications to simulation, numerical methods and software design
The METAFONTbook by
Donald Ervin Knuth(
Book
)
61 editions published between 1953 and 2012 in English and held by 648 WorldCat member libraries worldwide
Computing Methodologies  Text Processing
61 editions published between 1953 and 2012 in English and held by 648 WorldCat member libraries worldwide
Computing Methodologies  Text Processing
Mathematical writing by
Donald Ervin Knuth(
Book
)
32 editions published between 1987 and 1996 in English and Undetermined and held by 619 WorldCat member libraries worldwide
Do you need help getting started as an individual or as a member of a group facing the need to prepare formal documents? This is an allout attack on the problem of teaching people the art of mathematical writing. Learn how others have made use of student assistants in ways that benefit all parties. Read how feedback from students supplies early warning signals from instructors, as well as helping students clarify their thought processes. This book will give aid and encouragement to those wishing to teach a course in technical writing, or to those who wish to write themselves
32 editions published between 1987 and 1996 in English and Undetermined and held by 619 WorldCat member libraries worldwide
Do you need help getting started as an individual or as a member of a group facing the need to prepare formal documents? This is an allout attack on the problem of teaching people the art of mathematical writing. Learn how others have made use of student assistants in ways that benefit all parties. Read how feedback from students supplies early warning signals from instructors, as well as helping students clarify their thought processes. This book will give aid and encouragement to those wishing to teach a course in technical writing, or to those who wish to write themselves
Axioms and hulls by
Donald Ervin Knuth(
Book
)
20 editions published between 1991 and 1992 in English and German and held by 591 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
20 editions published between 1991 and 1992 in English and German and held by 591 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 : the program by
Donald Ervin Knuth(
Book
)
54 editions published between 1983 and 2012 in English and Undetermined and held by 570 WorldCat member libraries worldwide
Volume B
54 editions published between 1983 and 2012 in English and Undetermined and held by 570 WorldCat member libraries worldwide
Volume B
MMIXware : a RISC computer for the third millennium by
Donald Ervin Knuth(
Book
)
23 editions published between 1999 and 2014 in English and held by 550 WorldCat member libraries worldwide
"The main purpose of this book is to provide a complete documentation of the MMIX computer and its assembly language, together with all necessary lowlevel details such as the format of MMMIX object files. A secondary purpose is to provide literate programs of interest in their own right." "All programs of this book are in the public domain, and their latest versions can be downloaded from MMIX's home page together with dozens of example programs from The Art of Computer Programming."Jacket
23 editions published between 1999 and 2014 in English and held by 550 WorldCat member libraries worldwide
"The main purpose of this book is to provide a complete documentation of the MMIX computer and its assembly language, together with all necessary lowlevel details such as the format of MMMIX object files. A secondary purpose is to provide literate programs of interest in their own right." "All programs of this book are in the public domain, and their latest versions can be downloaded from MMIX's home page together with dozens of example programs from The Art of Computer Programming."Jacket
The Stanford GraphBase : a platform for combinatorial computing by
Donald Ervin Knuth(
Book
)
32 editions published between 1993 and 2009 in English and Undetermined and held by 485 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
32 editions published between 1993 and 2009 in English and Undetermined and held by 485 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
Algorithms in modern mathematics and computer science : proceedings, Urgench, Uzbek SSR, September 1622, 1979 by
A. P Ershov(
Book
)
23 editions published in 1981 in 3 languages and held by 469 WorldCat member libraries worldwide
23 editions published in 1981 in 3 languages and held by 469 WorldCat member libraries worldwide
Computer modern typefaces by
Donald Ervin Knuth(
Book
)
37 editions published between 1986 and 2011 in 3 languages and held by 464 WorldCat member libraries worldwide
Volume E
37 editions published between 1986 and 2011 in 3 languages and held by 464 WorldCat member libraries worldwide
Volume E
METAFONT : the program by
Donald Ervin Knuth(
Book
)
33 editions published between 1953 and 2011 in English and held by 448 WorldCat member libraries worldwide
Volume D
33 editions published between 1953 and 2011 in English and held by 448 WorldCat member libraries worldwide
Volume D
A=B by
Marko Petkovšek(
Book
)
5 editions published between 1996 and 2006 in English and Japanese and held by 441 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
5 editions published between 1996 and 2006 in English and Japanese and held by 441 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
TEX and METAFONT : new directions in typesetting by
Donald Ervin Knuth(
Book
)
18 editions published between 1979 and 1980 in English and held by 426 WorldCat member libraries worldwide
18 editions published between 1979 and 1980 in English and held by 426 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Artificial intelligence Baskett, Forest 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 Computer science Computer scienceMathematics Computer scientists Computer software Convex polytopes Font editors Geometry Information storage and retrieval systems Knuth, Donald Ervin, Lederberg, Joshua Mathematics MathematicsAuthorship Mathematics printing Mathematics printingComputer programs Matroids METAFONT Miller, William F MMIX (Computer architecture) Moravec, Hans P Number theory Printing Programming (Mathematics) Reduced instruction set computers Software engineering Sorting (Electronic computers) Stanford GraphBase Stanford University.Computer Science Department Surreal numbers Technical writing Technical writingStudy and teaching TeX (Computer file) Type and typefounding Type and typefoundingData processing Typesetting Universities and collegesFaculty
Covers
Alternative Names
Donald E. Knuth
Donald E. Knuth amerikanischer Informatiker, emeritierter Professor für Informatik an der Stanford University
Donald E. Knuth amerikansk datalog
Donald E. Knuth USamerikanischer Informatiker, emeritierter Professor für Informatik an der Stanford University
Donald Ervin Knuth
Donald Ervin Knuth americký informatik
Donald Knut
Donald Knuth
Donald Knuth American computer scientist
Donald Knuth Amerikaans wiskundige
Donald Knuth amerykański matematyk
Donald Knuth científico en computadoras estadounidense
Donald Knuth informàtic estatunidenc
Donald Knuth informaticien américain
Donald Knuth informatico statunitense
Donald Knuth matemático e cientista da computação americano
Donald Knuth Một nhà khoa học máy tính
Donald Knuth ríomheolaí Meiriceánach
Donalds Knuts
Ervin Knuth, Donald
Ervin Knuth Donald 1938....
Knut, D.
Knut, D. 1938
Knut, E.
Knuth, D.
Knuth, D. 1938
Knuth, D. (Donald)
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
wnnna Knuth, Donald Ervin, 19381973
Ντόναλντ Κνουθ
Доналд Кнут
Дональд Кнут
Дональд Эрвин Кнут американский учёный в области информатики
Дональд Эрвін Кнут
Кнут, Д 1938
Кнут Дональд Э.
Кнут, Дональд Э 1938
Кнут, Дональд Эрвин американский учёный
Դոնալդ Կնուտ
דונלד קנות'
دانلد کنوت ریاضیدان، دانشمند علوم کامپیوتر، و مهندس آمریکایی
دونالد كانوث
डोनाल्ड क्नुथ
ডোনাল্ড কানুথ
டொனால்ட் குனுத்
డొనాల్డ్ నూత్
ഡൊണാൾഡ് കനൂത്ത്
โดนัลด์ คนูธ
โดนัลด์ คนูธ Mr Piyavit phoomnoi cost.
დონალდ კნუთი
도널드 크누스
도널드 크누스 미국의 컴퓨터 과학자
커누스, 도널드 1938
커누스, 도널드 E. 1938
커누스, 도널드 에빈 1938
크너스, 도날드 어빈 1938
크누스, 도날드 어빈 1938
クヌース, ドナルド・E
クヌース, ドナルド エルヴィン
ドナルド・クヌース アメリカ合衆国の計算機科学者
高德纳
高德纳 美國計算機科學家
Languages