Selected Papers on Design of Algorithms

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $27.00
Usually ships in 1-2 business days
(Save 22%)
Other sellers (Paperback)
  • All (5) from $27.00   
  • New (4) from $33.43   
  • Used (1) from $27.00   


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.

Read More Show Less

Product Details

Meet the Author

Donald E. Knuth is the Fletcher Jones Professor of Computer Science emeritus at Stanford University.

Read More Show Less

Table of Contents


1 Robert W Floyd, in Memoriam
2 The Bose–Nelson Sorting Problem
3 A One-Way, Stackless Quicksort Algorithm
4 Optimum Binary Search Trees
5 Dynamic Huffman Coding
6 Inhomogeneous Sorting
7 Lexicographic Permutations with Restrictions
8 Nested Satisfiability
9 Fast Pattern Matching in Strings
10 Addition Machines
11 A Simple Program Whose Proof Isn't
12 Verification of Link-Level Protocols
13 A Problem in Concurrent Programming Control
14 Optimal Prepaging and Font Caching
15 A Generalization of Dijkstra's Algorithm
16 Two-Way Rounding
17 Matroid Partitioning
18 Irredundant Intervals
19 Simple World Problems in Universal Algebras
20 Efficient Representation of Perm Groups
21 An Algorithm for Brownian Zeros
22 Semi-Optimal Bases for Linear Dependencies
23 Evading the Drift in Floating-Point Addition
24 Deciphering a Linear Congruential Encryption
25 Computation of Tangent, Euler, and Bernoulli Numbers
26 Euler's Constant to 1271 Places
27 Evaluation of Polynomials by Computer
28 Minimizing Drum Latency Time


Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)