**Combinatorial Algorithms**

by Albert Nijenhuis, Herbert S. Wilf

**Publisher**: Academic Press Inc 1978**ISBN/ASIN**: 0125192509**ISBN-13**: 9780125192507**Number of pages**: 316

**Description**:

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

Download or read it online for free here:

**Download link**

(5.5MB, PDF)

## Similar books

**New Perspectives in Algebraic Combinatorics**

by

**Louis J. Billera, at al.**-

**Cambridge University Press**

The rich combinatorial problems arising from the study of various algebraic structures are the subject of the book. It will present the state of the art to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.

(

**7302**views)

**Foundations of Combinatorics with Applications**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This introduction to combinatorics, the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. Some ability to construct proofs is assumed.

(

**6289**views)

**Analytic Combinatorics**

by

**Philippe Flajolet, Robert Sedgewick**-

**Cambridge University Press**

Deals with the the analysis of discrete structures, that emerged over the past years as an essential tool in the understanding of computer programs and models with applications in science. The text contains examples and exercises.

(

**11930**views)

**Algebraic and Geometric Methods in Enumerative Combinatorics**

by

**Federico Ardila**-

**arXiv**

The main goal of this survey is to state clearly and concisely some of the most useful tools in algebraic and geometric enumeration, and to give many examples that quickly and concretely illustrate how to put these tools to use.

(

**3343**views)