%{search_type} search results

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.
(source: Nielsen Book Data)

Donald E. Knuth has been making foundational contributions to the field of computer science for as long as computer science has been a field. His award-winning textbooks are often given credit for shaping the field, and his scientific papers are widely referenced and stand as milestones of development for a wide variety of topics. The present volume, the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. Nearly thirty of Knuth's classic papers are collected in this book and brought up to date with extensive revisions and notes on subsequent developments. The papers cover numerous discrete problems, such as assorting, searching, data compression, theorem proving, and cryptography, as well as methods for controlling errors in numerical computations.
(source: Nielsen Book Data)

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.
(source: Nielsen Book Data)

• 1. Discussion of Mr. Riordan's paper 'Abel identities and inverse relations'--
• 2. Duality in addition chains--
• 3. Combinatorial analysis and computers--
• 4. Tables of finite fields--
• 5. Finite semifields and projective planes--
• 6. A class of projective planes--
• 7. Construction of a random sequence--
• 8. Oriented subtrees of an arc digraph--
• 9. Another enumeration of trees--
• 10. Notes on central groupoids--
• 11. Permutations, matrices, and generalized Young tableaux--
• 12. A note on solid partitions--
• 13. Subspaces, subsets, and partitions--
• 14. Enumeration of plane partitions--
• 15. Complements and transitive closures--
• 16. Permutations with nonnegative partial sums--
• 17. Wheels within wheels--
• 18. The asymptotic number of geometries--
• 19. Random matroids--
• 20. Identities from partition involutions--
• 21. Huffman's algorithm via algebra--
• 22. A permanent inequality--
• 23. Efficient balanced codes--
• 24. The power of a prime that divides a generalized binomial coefficient--
• 25. The first cycles in an evolving graph--
• 26. The birth of the giant component--
• 27. Polynomials involving the floor function--
• 28. The sandwich theorem--
• 29. Aztec diamonds, checkerboard graphs, and spanning trees.
• (source: Nielsen Book Data)

Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, his papers are widely referenced and stand as milestones of development over a wide range of topics. This volume assembles more than three dozen of Professor Knuth's pioneering contributions to discrete mathematics. It includes a variety of topics in combinatorial mathematics (finite geometries, graph theory, enumeration, partitions, tableaux, matroids, codes); discrete algebra (finite fields, groupoids, closure operators, inequalities, convolutions, Pfaffians); and concrete mathematics (recurrence relations, special numbers and notations, identities, discrete probability). Of particular interest are two fundamental papers in which the evolution of random graphs is studied by means of generating functions.
(source: Nielsen Book Data)

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.
(source: Nielsen Book Data)

• 1. Digital typography--
• 2. Mathematical typography--
• 3. Breaking paragraphs into lines--
• 4. Mixing right-to-left texts with left-to-right texts--
• 5. Recipes and fractions--
• 6. The TeX logo in various fonts--
• 7. Printing out selected pages--
• 8. Macros for Jill--
• 9. Problem for a Saturday morning--
• 10. Exercises for TeX: the program--
• 11. Mini-indexes for literate programs--
• 12. Virtual fonts: more fun for Grand Wizards--
• 13. The letter S--
• 14. My first experience with Indian scripts--
• 15. The concept of a meta-font--
• 16. Lessons learned from MetaFont--
• 17. AMS Euler - a new typeface for mathematics--
• 18. Typesetting concrete mathematics--
• 19. A course on MetaFont programming--
• 20. A punk meta-font--
• 21. Fonts for digital halftones--
• 22. Digital halftones by Dot diffusion--
• 23. A note on digital angles--
• 24. TEXDR.AFT--
• 25. TEX.ONE--
• 26. TeX Incunabula--
• 27. Icons for TeX and MetaFont--
• 28. Computers and typesetting--
• 29. The new versions of TeX and MetaFont--
• 30. The future of TeX and MetaFont--
• 31. Questions and answers, I--
• 32. Questions and answers, II--
• 33. Questions and answers, III-- Index.
• (source: Nielsen Book Data)

Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, Knuth has written papers which stand as milestones of development over a wide range of topics. In this collection, the second in the series, Knuth explores the relationship between computers and typography. The present volume, in the words of the author, is the legacy of all the work he has done on typography. When type designers, punch cutters, typographers, book historians, and scholars visited the University while Knuth was working in this field, it gave to Stanford what some consider to be its golden age of digital typography. By the author's own admission, the present work is one of the most difficult books that he has prepared. This is truly a work that only Knuth could have produced.
(source: Nielsen Book Data)

• 1. Basic Concepts. Algorithms. Mathematical Preliminaries. Mathematical Induction. Numbers, Powers, and Logarithms. Sums and Products. Integer Functions and Elementary Number Theory. Permutations and Factorials. Binomial Coefficients. Harmonic Numbers. Fibonacci Numbers. Generating Functions. Analysis of an Algorithm. Asymptotic Representations. MIX. Description of MIX. The MIX Assembly Language. Applications to Permutations. Some Fundamental Programming Techniques. Subroutines. Coroutines. Interpretive Routines. Input and Output. History and Bibliography.
• 2. Information Structures. Introduction. Linear Lists. Stacks, Queues, and Deques. Sequential Allocation. Linked Allocation. Circular Lists. Doubly Linked Lists. Arrays and Orthogonal Lists. Trees. Traversing Binary Trees. Binary Tree Representation of Trees. Other Representations of Trees. Basic Mathematical Properties of Trees. Lists and Garbage Collection. Multilinked Structures. Dynamic Storage Allocation. History and Bibliography. Answers to Exercises. Appendix A. Tables of Numerical Quantities.
• 1. Fundamental Constants (decimal).
• 2. Fundamental Constants (octal).
• 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896834T02272003.
• (source: Nielsen Book Data)

• 3. Random Numbers. Introduction. Generating Uniform Random Numbers. The Linear Congruential Method. Other Methods. Statistical Tests. General Test Procedures for Studying Random Data. Empirical Tests. Theoretical Tests. The Spectral Test. Other Types of Random Quantities. Numerical Distributions. Random Sampling and Shuffling. What Is a Random Sequence? Summary.
• 4. Arithmetic. Positional Number Systems. Floating Point Arithmetic. Single-Precision Calculations. Accuracy of Floating Point Arithmetic. Double-Precision Calculations. Distribution of Floating Point Numbers. Multiple Precision Arithmetic. The Classical Algorithms. Modular Arithmetic. How Fast Can We Multiply? Radix Conversion. Rational Arithmetic. Fractions. The Greatest Common Divisor. Analysis of Euclid's Algorithm. Factoring into Primes. Polynomial Arithmetic. Division of Polynomials. Factorization of Polynomials. Evaluation of Powers. Evaluation of Polynomials. Manipulation of Power Series. Answers to Exercises. Appendix A. Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896842T03062003.
• (source: Nielsen Book Data)

• 5. Sorting. Combinatorial Properties of Permutations. Inversions. Permutations of a Multiset. Runs. Tableaux and Involutions. Internal sorting. Sorting by Insertion. Sorting by Exchanging. Sorting by Selection. Sorting by Merging. Sorting by Distribution. Optimum Sorting. Minimum-Comparison Sorting. Minimum-Comparison Merging. Minimum-Comparison Selection. Networks for Sorting. External Sorting. Multiway Merging and Replacement Selection. The Polyphase Merge. The Cascade Merge. Reading Tape Backwards. The Oscillating Sort. Practical Considerations for Tape Merging. External Radix Sorting. Two-Tape Sorting. Disks and Drums. Summary, History, and Bibliography.
• 6. Searching. Sequential Searching. Searching by Comparison of Keys. Searching an Ordered Table. Binary Tree Searching. Balanced Trees. Multiway Trees. Digital Searching. Hashing. Retrieval on Secondary Keys. Answers to Exercises. Appendix A: Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B: Index to Notations. Index and Glossary. 0201896850T04062001.
• (source: Nielsen Book Data)

• Preface Notes on the Exercises
• Chapter 7: Combinatorial Searching 1 7.1: Zeros and Ones 47 7.2: Generating All Possibilities 281 Answers to Exercises 514 Appendix A: Tables of Numerical Quantities 818 Appendix B: Index to Notations 822 Appendix C: Index to Algorithms and Theorems 828 Appendix D: Index to Combinatorial Problems 830 Index and Glossary 834.
• (source: Nielsen Book Data)

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. --Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the line-up. --Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. --Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. --Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures--the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently.Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.
(source: Nielsen Book Data)
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. --Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the line-up. --Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. --Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. --Jonathan Laventhol The first revision of this third volume is the most comprehensive survey of classical 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 new discussions of the theory of permutations and of universal hashing.
(source: Nielsen Book Data)
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. --Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home...and even at a Little League game when my son wasn't in the line-up. --Charles Long If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. --Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. --Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis.Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series.
(source: Nielsen Book Data)
The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient "review" of future volumes could almost be: "Knuth, Volume n has been published." -Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. -Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library. Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e ISBN: 0321751043.
(source: Nielsen Book Data)

• Introduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions: coupon collecting Theoretical developments: application to the shortest path Searching a table by hashing-- mean behavior of thefundamental algorithm Implementing the fundamental algorithm Research problems Annotated bibliography Appendix A. Later developments Appendix B. Solutions to exercises Index.
• (source: Nielsen Book Data)

'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.
(source: Nielsen Book Data)

• 1. Von Neumann's first computer program--
• 2. Ancient Babylonian algorithms--
• 3. George Forsythe and the development of computer science--
• 4. Computer science and its relation to mathematics--
• 5. Algorithms--
• 6. Mathematics and computer science: Coping with finiteness--
• 7. Algorithms in modern mathematics and computer science--
• 8. The IBM
• 650: an appreciation from the field--
• 9. Theory and practice--
• 10. Algorithm and program-- information and data--
• 11. Are toy problems useful?--
• 12. Theory and practice--
• 13. Algorithmic themes--
• 14. Typesetting concrete mathematics--
• 15. Computer programming and computer science--
• 16. This week's citation classic: artistic programming.
• (source: Nielsen Book Data)

This anthology of essays from the inventor of literate programming is a survey of Donald Knuth's papers on computer science. Donald Knuth's influence in computer science ranges from the invention of literate programming to the development of the TeX programming language. One of the foremost figures in the field of mathematical sciences, his papers are widely referenced and stand as milestones of development over a wide range of topics. This collection focuses on Professor Knuth's published science papers that serve as accessible surveys of their subject matter. It includes articles on the history of computing, algorithms, numerical techniques, computational models, typesetting, and more. This book will be appreciated by students and researchers from a wide range of areas within computer science and mathematics.
(source: Nielsen Book Data)

• (Most chapters contain Exercises.)
• 1. Recurrent Problems. The Tower of Hanoi. Lines in the Plane. The Josephus Problem. Exercises.
• 2. Sums. Notation. Sums and Recurrences. Manipulation of Sums. Multiple Sums. General Methods. Finite and Infinite Calculus. Infinite Sums. Exercises.
• 3. Integer Functions. Floors and Ceilings. Floor/Ceiling Applications. Floor/Ceiling Recurrences. 'mod': The Binary Operation. Floor/Ceiling Sums. Exercises.
• 4. Number Theory. Divisibility. Factorial Factors. Relative Primality. 'mod': The Congruence Relation. Independent Residues. Additional Applications. Phi and Mu. Exercises.
• 5. Binomial Coefficients. Basic Identities. Basic Practice. Tricks of the Trade. Generating Functions. Hypergeometric Functions. Hypergeometric Transformations. Partial Hypergeometric Sums. Mechanical Summation. Exercises.
• 6. Special Numbers. Stirling Numbers. Eulerian Numbers. Harmonic Numbers. Harmonic Summation. Bernoulli Numbers. Fibonacci Numbers. Continuants. Exercises.
• 7. Generating Functions. Domino Theory and Change. Basic Maneuvers. Solving Recurrences. Special Generating Functions. Convolutions. Exponential Generating Functions. Dirichlet Generating Functions. Exercises.
• 8. Discrete Probability. Definitions. Mean and Variance. Probability Generating Functions. Flipping Coins. Hashing. Exercises.
• 9. Asymptotics. A Hierarchy. O Notation. O Manipulation. Two Asymptotic Tricks. Euler's Summation Formula. Final Summations. Exercises. A. Answers to Exercises. B. Bibliography. C. Credits for Exercises. Index. List of Tables. 0201558025T04062001.
• (source: Nielsen Book Data)

This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known 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 self-study. 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. 0201558025B04062001.
(source: Nielsen Book Data)

• Part 1: overview - Words, Roget, Books, Econ, Games, Miles, Plane, Lisa, Raman, Gates, Rand, Basic, Save-- technicalities - representation of Graphs, Words, Roget, Books, Econ, Games, Miles, Plane-- installation and use - how to obtain the files, installing CWEB, installing the graphbase, makefile details, troubleshooting, running the demos, storage considerations, running your own programs-- how to read CWEB programs - programs of the Stanford GraphBase, ASSIGN_LISA, BOOK_COMPONENTS, ECON_ORDER, FOOTBALL, GB_BASIC, GB_BOOKS, GB_DIJK, GB_ECON, GB_FLIP, GB_GAMES, GB_GATES, GB_GRAPH, GB_IO, GB_LISA, GB_MILES, GB_PLANE, GB_RAMAN, GB_RAND, GB_ROGET, GB_SAVE, GB_SORT, GB_WORDS, GIRTH, LADDERS, MILES_SPAN, MULTIPLY, QUEEN, ROGET_COMPONENTS, TAKE_RISC, TEST_SAMPLE, WORD_COMPONENTS, index to all the programs. Appendices: error codes-- summary of function calls - generators, nongenerators-- example graph parameters - undirected graphs, directed graphs-- 300 five-letter words.
• (source: Nielsen Book Data)

The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to 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, 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. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible 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. Features *Includes new contributions to our understanding of important algorithms and data structures *Provides a standard tool for evaluating combinatorial algorithms *Demonstrates a more readable, more practical style of programming *Challenges readers to surpass his own efficient algorithms 0201542757B04062001.
(source: Nielsen Book Data)

• 1. Computer programming as an art--
• 2. Structured programming with go to statements--
• 3. A structured program to generate all topological sorting arrangements--
• 4. Literate programming--
• 5. Programming pearls: sampling--
• 6. Programming pearls, continued: common words--
• 7. How to read a WEB--
• 8. Excerpts from the programs for TEX and METAFONT--
• 9. Mathematical writing--
• 10. The errors of TEX--
• 11. The error log of TEX--
• 12. An example of CWEB-- Further reading-- Index.
• (source: Nielsen Book Data)

Literate programming is a programming methodology that combines a programming language with a documentation language, making programs more robust, more portable, and more easily maintained than programs written only in a high-level language. Computer programmers already know both kinds of languages; they need only learn a few conventions about alternating between languages to create programs that are works of literature. A literate programmer is an essayist who writes programs for humans to understand, instead of primarily writing instructions for machines to follow. When programs are written in the recommended style they can be transformed into documents by a document compiler and into efficient code by an algebraic compiler. This anthology of essays from the inventor of literate programming includes Knuth's early papers on related topics such as structured programming, as well as the Computer Journal article that launched literate programming itself.
(source: Nielsen Book Data)

'METAFONT' is a system for the design of symbols and alphabetic characters suited to raster-based devices that print or display text. The construction of a typeface is an art form and this manual is written for people who wish to advance the quality of mathematical typesetting. The METAFONT book enables readers, with only minimal computer science or word processing experience, to master the basic as well as the more advanced features of METAFONT programming. With this manual, readers will learn how to write a program using METAFONT that can customize a type design that already exists, create an entire alphabet from scratch, and create logos or special symbols.
(source: Nielsen Book Data)

• 1. Minicourse on technical writing--
• 2. An exercise on technical writing--
• 3. An answer to the exercise--
• 4. Comments on student answers--
• 5. Preparing books for publication--
• 6. Handy reference book--
• 7. Presenting algorithms--
• 8. Literate programming--
• 9. User manuals--
• 10. Galley proofs--
• 11. Refereeing--
• 12. Hints for referees--
• 13. Illustrations--
• 14. Homework: subscripts and superscripts--
• 15. Homework: solutions--
• 16. Quotations--
• 17. Scientific American saga--
• 18. Examples of good style--
• 19. Mary-Claire van Leunen on 'hopefully'--
• 20. Herb Wilf on mathematical writing--
• 21. Wilf's first extreme--
• 22. Wilf's other extreme--
• 23. Jeff Ullman on getting rich--
• 24. Leslie Lamport on writing papers--
• 25. Lamport's handout on unnecessary prose--
• 26. Lamport's handout on styles of proof--
• 2. Nils Nilsson on art and writing--
• 28. Mary-Claire van Leunen on callisthenics--
• 29. Mary-Claire's handout on compositional exercises--
• 30. Comments on student work--
• 31. Mary-Claire van Leunen on which vs. that--
• 32. Computer aids to writing--
• 33. Rosalie Stemer on copy editing--
• 34. Paul Halmos on mathematical writing--
• 35. Final truths.
• (source: Nielsen Book Data)

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 all-out 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.
(source: Nielsen Book Data)

Here is the definitive guide to the use of TeX, written by the system's creator, Donald E. Knuth. TeX represents the state of the art in computer typesetting. It is particularly valuable where the document, article, or book to be produced contains a lot of mathematics, and where the user is concerned about typographic quality. TeX software offers both writers and publishers the opportunity to produce technical text of all kinds, in an attractive form, with the speed and efficiency of a computer system. Novice and expert users alike will gain from The TeXbook the level of information they seek. Knuth warns newcomers away from the more difficult areas, while he entices experienced users with new challenges. The novice need not learn much about TeX to prepare a simple manuscript with it. But for the preparation of more complex documents, The TeXbook contains all the detail required. Knuth's familiar wit, and illustrations specially drawn by Duane Bibby, add a light touch to an unusually readable software manual. The TeXbook is the first in a five-volume series on Computers and Typesetting, all authored by Knuth. 0201134489B04262002.
(source: Nielsen Book Data)

Here is the definitive guide to the use of TeX, written by the system's creator, Donald E. Knuth. TeX represents the state of the art in computer typesetting. It is particularly valuable where the document, article, or book to be produced contains a lot of mathematics, and where the user is concerned about typographic quality. TeX software offers both writers and publishers the opportunity to produce technical text of all kinds, in an attractive form, with the speed and efficiency of a computer system. Novice and expert users alike will gain from The TeXbook the level of information they seek. Knuth warns newcomers away from the more difficult areas, while he entices experienced users with new challenges. The novice need not learn much about TeX to prepare a simple manuscript with it. But for the preparation of more complex documents, The TeXbook contains all the detail required. Knuth's familiar wit, and illustrations specially drawn by Duane Bibby, add a light touch to an unusually readable software manual. The TeXbook is the first in a five-volume series on Computers and Typesetting, all authored by Knuth. 0201134489B04262002.
(source: Nielsen Book Data)