This book will help those wishing to teach a course in technical writing, or who wish to write themselves.

Part of a multivolume work on the analysis of algorithms, this title deals with combinatorial searching. Specifically, it discusses the generation of n-tuples, then extends those ideas to permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored.

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty ...

How does a computer scientist understand infinity? What can probability theory teach us about free will? This book contains six informal lectures by computer scientist Donald E. Knuth exploring the relationship between his vocation and his faith.

Presents basic programming concepts and techniques. This book focuses on the representation of information inside a computer, the structural relationships between data elements, and how to deal with them efficiently. It gives elementary applications to simulation, numerical methods, symbolic computing, software and system design.

Focusing on the analysis of algorithms, this title covers the various techniques for generating combinations and partitions. It also includes several creative exercises.

Derived from an advanced computer science course at Stanford University, this book 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. It covers recurrence relations and operator methods.

Introduces the mathematics that supports advanced computer programming and the analysis of algorithms. This book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems. It is useful for computer scientists and also for users of mathematics in various disciplines.

A shrinkwrapped bundle of Fascicles 0-4 of Knuth's Volume 4, arguably the most influential work ever written on computer programming * These five fascicles comprise roughly the first 30% of the long-awaited Volume 4 of The Art of Computer Programming * Suggested list price is off the price of buying them individually * These fascicles contain many new exercises, arranged carefully for ...

Presents a comprehensive survey of classical computer techniques for sorting and searching. This book considers both large and small databases and internal and external memories. It contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency, and also a section on optimum sorting.

'METAFONT' is a system for the design of symbols and alphabetic characters suited to raster-based devices that print or display text. This 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.

The text 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.

This monograph attempts a comprehensive investigation of a basic computational problem: to find a formal mathematical computerization of which pairs of cities on a map are neighbours of each other.

Focusing on the analysis of algorithms, this title covers the generation of various trees. Covering the history of combinatorial generation, it also tells a story of relevance to artful programmers.

How does a computer scientist understand infinity? What can probability theory teach us about free will? This book contains six informal lectures by computer scientist Donald E. Knuth exploring the relationship between his vocation and his faith.

Uses the 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.

Part of a multivolume work on the analysis of algorithms, this work provides a programmer's introduction to the MMIX, a RISC-based computer that replaces the original MIX, and describes the MMIX assembly language. It also presents material on subroutines, coroutines, and interpretive routines.

This volume is devoted to Analysis of Algorithms, a field that Knuth founded and still considers his main life's work.