Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Selected Papers on Design of Algorithms (Volume 191) (Lecture Notes)

Donald Ervin Knuth

0/5 ( ratings)

Donald Knuth’s influence in computer science ranges from the invention of methods for translating and defining programming languages to the creation of the TEX and METAFONT systems for desktop publishing. His award-winning textbooks have become classics that are often given credit for shaping the field; his scientific papers are widely referenced and stand as milestones of development over a wide variety of topics. The present volume, which is the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. It covers methods for numerous discrete problems such as sorting, searching, data compression, optimization, theorem-proving, and cryptography, as well as methods for controlling errors in numerical computations and for Brownian motion. Nearly thirty of Knuth’s classic papers on the subject are collected in this book, brought up to date with extensive revisions and notes on subsequent developments. Many of these algorithms have seen wide use—for example, Knuth’s algorithm for optimum search trees, the Faller-Gallagher-Knuth algorithm for adaptive Huffman coding, the Knuth-Morris-Pratt algorithm for pattern matching, the Dijkstra-Knuth algorithm for optimum expressions, and the Knuth-Bendix algorithm for deducing the consequences of axioms. Others are pedagogically important, helping students to learn how to design new algorithms for new tasks. One or two are significant historically, as they show how things were done in computing’s early days. All are found here, together with more than forty newly created illustrations.

Language: English

Pages: 453

Format: Paperback

Release: April 15, 2010

ISBN 13: 9781575865829

Selected Papers on Design of Algorithms (Volume 191) (Lecture Notes)

Donald Ervin Knuth

0/5 ( ratings)

Donald Knuth’s influence in computer science ranges from the invention of methods for translating and defining programming languages to the creation of the TEX and METAFONT systems for desktop publishing. His award-winning textbooks have become classics that are often given credit for shaping the field; his scientific papers are widely referenced and stand as milestones of development over a wide variety of topics. The present volume, which is the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. It covers methods for numerous discrete problems such as sorting, searching, data compression, optimization, theorem-proving, and cryptography, as well as methods for controlling errors in numerical computations and for Brownian motion. Nearly thirty of Knuth’s classic papers on the subject are collected in this book, brought up to date with extensive revisions and notes on subsequent developments. Many of these algorithms have seen wide use—for example, Knuth’s algorithm for optimum search trees, the Faller-Gallagher-Knuth algorithm for adaptive Huffman coding, the Knuth-Morris-Pratt algorithm for pattern matching, the Dijkstra-Knuth algorithm for optimum expressions, and the Knuth-Bendix algorithm for deducing the consequences of axioms. Others are pedagogically important, helping students to learn how to design new algorithms for new tasks. One or two are significant historically, as they show how things were done in computing’s early days. All are found here, together with more than forty newly created illustrations.

Language: English

Pages: 453

Format: Paperback

Release: April 15, 2010

ISBN 13: 9781575865829

More books from Donald Ervin Knuth

Concrete Mathematics: A Foundation for Computer Science

4.3/5 ( ratings)

The Art of Computer Programming, Volume 1: Fundamental Algorithms

4.3/5 ( ratings)

The Art of Computer Programming, Volume 2: Seminumerical Algorithms

4.4/5 ( ratings)

The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

4.5/5 ( ratings)

Computers & Typesetting, Volume C: The Metafont Book

4.2/5 ( ratings)

Leaders in Computing: Changing the digital world

3.8/5 ( ratings)

Computers & Typesetting, Volume D: Metafont: The Program

The Essential Knuth

Numeri surreali : Come due ex studenti scoprirono la matematica pura e trovarono la vera felicità

The Art of Computer Programming, Volume 1, Fascicle 1: MMIX -- A RISC Computer for the New Millennium

4.8/5 ( ratings)

Algorithmic Barriers Falling: P=NP?

4.8/5 ( ratings)

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

4.7/5 ( ratings)

The Cweb System Of Structured Documentation: Version 3. 0

The Art of Computer Programming, Volume 4A: Combinatorial Algorithms Part 1

Искусство программирования, том 4, A. Комбинаторные алгоритмы, часть 1

The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability

Selected Papers on Computer Languages (Volume 139) (Lecture Notes)

Mathematical Writing (Mathematical Association of America Notes, Series Number 14)

Arithmetik: Aus der Reihe The Art of Computer Programming (German Edition)

Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek SSR September 16-22, 1979

Rate this book!

Write a review?