**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

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**11953**views)

**Greedy Algorithms**

by

**Witold Bednorz**-

**InTech**

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.

(

**10313**views)

**A=B**

by

**Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger**-

**AK Peters, Ltd.**

The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.

(

**19853**views)

**Lecture Notes on Bucket Algorithms**

by

**Luc Devroye**-

**Birkhauser**

In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.

(

**7530**views)