Donald E. Knuth – författare

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.

'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer science for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 1975.The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms. The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an annotated bibliography, and research problems are included.The text would be appropriate as supplementary reading for undergraduate research seminars or courses in algorithmic analysis and for graduate courses in combinatorial algorithms, operations research, economics, or analysis of algorithms. Donald E. Knuth is one of the most prominent figures of modern computer science. His works in ""The Art of Computer Programming"" are classic. He is also renowned for his development of TeX and METAFONT. In 1996, Knuth won the prestigious Kyoto Prize, considered to be the nearest equivalent to a Nobel Prize in computer science.

In this second collection in the series, Knuth explores the relationship between computers and typography.

How does a computer scientist understand infinity? What can probability theory teach us about free will? Can mathematical notions be used to enhance one's personal understanding of the Bible? This book contains six informal lectures by computer scientist Donald E. Knuth exploring the relationship between his vocation and his faith, revealing the unique perspective that his work with computing has lent to his understanding of God. Knuth's starting point is his 3:16 project, an application of mathematical "random sampling" to the books of the Bible. The first lectures tell the story of the project's conception and execution, exploring the complex dimensions of language translation, aesthetics, and theological history. Knuth also reveals the many insights that he has gained along the way from such interdisciplinary work. The theological musings culminate in a final lecture which tackles infinity, free will, and the other "big questions" that lie at the juncture of theology and computation. Each lecture ends with a question and answer exchange.

This volume, sixth in a series of collected works by world-renowned computer scientist Donald E. Knuth, assembles approximately two doxen of his pioneering contributions to the field of computer languages, including papers on ALGOL, SOL, RUNCIBLE, and FORTRAN. Papers on the early development of programming languages, the history of writing compilers, the characterization of parenthesis languages, and the semantics of context-free languages are also included.

This book is a French translation of seventeen papers by Donald E. Knuth on algorithms both in the field of analysis of algorithms and in the design of new algorithms. They cover fundamental concepts and techniques and numerous discrete problems such as sorting, searching, data compression, theorem-proving, and cryptography, as well as methods for controlling errors in numerical computations.

Donald E. Knuth's seminal publications have earned him a loyal following among scholars and computer scientists, and his award-winning textbooks have become classics that are often given credit for shaping the field of computer science. In this volume, he explains and comments on the changes he has made to his work over the last twenty years in response to new technologies and the evolving understanding of key concepts in computer science. His commentary is supplemented by a full bibliography of his works and a number of interviews with Knuth himself, which shed light on his professional life and publications as well as provide interesting biographical details. A giant in the field of computer science, Knuth has assembled materials that offer a full portrait of both the scientist and the man. The final volume of a series of his collected papers, "Companion to the Papers of Donald Knuth" is essential for the Knuth completist.

The interviews in this volume form the nearest thing possible to an autobiography of eminent computer scientist Donald E. Knuth. Based on the English-language Companion to the Papers of Donald Knuth, also published by CSLI Publications, this book brings the highlights of that material to a Francophone audience.

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 E. Knuth, is one of the greatest computer scientists of our time. A few years ago, he and some of his students were looking at a map that pinpointed the locations of about 100 cities. They asked, "Which of these cities are neighbours of each other?" They knew intuitively that some pairs of cities were neighbours and some were not; they wanted to find a formal mathematical characterization that would match their intuition. This monograph is the result.

Das Buch Arithmetik ist eine Übersetzung des vierten Kapitels der legendären Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der neuesten Fassung. Es handelt sich um eine umfangreiche Einführung in die Computeralgebra, die den neuesten Stand der Forschung berücksichtigt. Donald E. Knuth versteht es, die Algorithmen didaktisch sehr geschickt und ohne Kompromisse bei der Strenge aufzubereiten. Das Buch enthält außerdem Hunderte von Aufgaben verschiedener Schwierigkeitsgrade mit Lösungen. Der Übersetzer, Prof. Dr. R. Loos, lehrt an der Universität Tübingen.

MMIX is a RISC computer designed by Don Knuth to illustrate machine-level aspects of programming. In the author's book series "The Art of Computer Programming", MMIX replaces the 1960s-style machine MIX. A particular goal in the design of MMIX was to keep its machine language simple, elegant, and easy to learn. At the same time, all of the complexities needed to achieve high performance in practice are taken into account. This book constitutes 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. The latest version of all programs can be downloaded from MMIX's home page. The book provides a complete documentation of the MMIX computer and its assembly language. It also presents mini-indexes, which make the programs much easier to understand.

Das Buch Arithmetik ist eine Übersetzung des vierten Kapitels der legendären Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der neuesten Fassung. Es handelt sich um eine umfangreiche Einführung in die Computeralgebra, die den neuesten Stand der Forschung berücksichtigt. Donald E. Knuth versteht es, die Algorithmen didaktisch sehr geschickt und ohne Kompromisse bei der Strenge aufzubereiten. Das Buch enthält außerdem Hunderte von Aufgaben verschiedener Schwierigkeitsgrade mit Lösungen. Der Übersetzer, Prof. Dr. R. Loos, lehrt an der Universität Tübingen.