**The Art of Computer Programming, Volume 4**

by Donald E. Knuth

**Publisher**: Addison-Wesley Professional 2006**ISBN/ASIN**: 0321335708**Number of pages**: 128

**Description**:

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.

Download or read it online for free here:

**Download link**

(multiple PDF,PS files)

## Similar books

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**9714**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**7163**views)

**Combinatorial Algorithms**

by

**Albert Nijenhuis, Herbert S. Wilf**-

**Academic Press Inc**

This is a collection of mathematical algorithms with many new and interesting examples in this second edition. The authors tried to place in the reader's hands a kit of building blocks with which the reader can construct more elaborate structures.

(

**13654**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**16604**views)