---
product_id: 8081420
title: "Analytic Combinatorics"
price: "€ 238.21"
currency: EUR
in_stock: true
reviews_count: 9
url: https://www.desertcart.gr/products/8081420-analytic-combinatorics
store_origin: GR
region: Greece
---

# Analytic Combinatorics

**Price:** € 238.21
**Availability:** ✅ In Stock

## Quick Answers

- **What is this?** Analytic Combinatorics
- **How much does it cost?** € 238.21 with free shipping
- **Is it available?** Yes, in stock and ready to ship
- **Where can I buy it?** [www.desertcart.gr](https://www.desertcart.gr/products/8081420-analytic-combinatorics)

## Best For

- Customers looking for quality international products

## Why This Product

- Free international shipping included
- Worldwide delivery with tracking
- 15-day hassle-free returns

## Description

Buy Analytic Combinatorics on desertcart.com ✓ FREE SHIPPING on qualified orders

Review: Totally Awesome - This book covers a LOT of ground FAST. You can think of it as the third volume in the following sequence: (1) Algorithms; Sedgewick and Wayne. Appropriate for an upper level undergrad/grad text book for a university algorithms course. (2) Analysis of Algorithms; Sedgewick and Flajolet. Much more detailed treatment of algorithms, and using the Generating Function approach to Algorithm Analysis. (3) Analytic Combinatorics: S&J. Advanced aspects of the above. Here is the setup: For some category of computer science or combinatorical object, let A[n] denote how many distinct examples there are of size n. Then the complex function f(z) = sum(A[n] z^n) is the "Generating function" for A[n]. The S&J methodology is (1) generate an equation for f(z) directly from the combinatorical object. (2) Use this equation to solve for f(z), or at least obtain info about it. (3) Use classical complex analysis (singularity analysis and saddle point methods) to obtain excellent estimates of A[n]. I am confident this will get easy once I work out about 100 examples!
Review: the bible of the subject - Flajolet and his group at INRIA (B. Salvy, P. Zimmermann, many others) have created the field of "analytic combinatorics", and this book has everything you might possibly want to know about the subject (since the selection of topics is very thoughtful, it does not have that much you would NOT want to know). The only reason to possibly not get this book (assuming you are interested in the subject) is that the PDF is available free on Flajolet's web page, but the book for is quite convenient and quite reasonably priced.

## Technical Specifications

| Specification | Value |
|---------------|-------|
| Best Sellers Rank | #880,040 in Books ( See Top 100 in Books ) #80 in Combinatorics (Books) #128 in Discrete Mathematics (Books) #2,345 in Mathematics (Books) |
| Customer Reviews | 4.3 4.3 out of 5 stars (23) |
| Dimensions  | 7 x 1.75 x 9.75 inches |
| Edition  | 1st |
| ISBN-10  | 0521898064 |
| ISBN-13  | 978-0521898065 |
| Item Weight  | 3.55 pounds |
| Language  | English |
| Print length  | 826 pages |
| Publication date  | January 19, 2009 |
| Publisher  | Cambridge University Press |

## Images

![Analytic Combinatorics - Image 1](https://m.media-amazon.com/images/I/61vT-97AH2L.jpg)

## Customer Reviews

### ⭐⭐⭐⭐⭐ Totally Awesome
*by R***Y on May 6, 2013*

This book covers a LOT of ground FAST. You can think of it as the third volume in the following sequence: (1) Algorithms; Sedgewick and Wayne. Appropriate for an upper level undergrad/grad text book for a university algorithms course. (2) Analysis of Algorithms; Sedgewick and Flajolet. Much more detailed treatment of algorithms, and using the Generating Function approach to Algorithm Analysis. (3) Analytic Combinatorics: S&J. Advanced aspects of the above. Here is the setup: For some category of computer science or combinatorical object, let A[n] denote how many distinct examples there are of size n. Then the complex function f(z) = sum(A[n] z^n) is the "Generating function" for A[n]. The S&J methodology is (1) generate an equation for f(z) directly from the combinatorical object. (2) Use this equation to solve for f(z), or at least obtain info about it. (3) Use classical complex analysis (singularity analysis and saddle point methods) to obtain excellent estimates of A[n]. I am confident this will get easy once I work out about 100 examples!

### ⭐⭐⭐⭐⭐ the bible of the subject
*by N***A on March 7, 2011*

Flajolet and his group at INRIA (B. Salvy, P. Zimmermann, many others) have created the field of "analytic combinatorics", and this book has everything you might possibly want to know about the subject (since the selection of topics is very thoughtful, it does not have that much you would NOT want to know). The only reason to possibly not get this book (assuming you are interested in the subject) is that the PDF is available free on Flajolet's web page, but the book for is quite convenient and quite reasonably priced.

### ⭐ Review
*by J***E on October 28, 2024*

Este libro es un clásico, pero está impreso con una calidad horrible, letras apenas legibles tanto por el tamaño como por la falta de contraste. Una pena, porque pensé que sería un plus tenerlo impreso. Me costó caro tanto el libro como su envío, una decepción total.

## Frequently Bought Together

- Analytic Combinatorics
- Introduction to the Analysis of Algorithms, An
- Algorithms (4th Edition)

---

## Why Shop on Desertcart?

- 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016
- 🌍 **Shop Globally** — Access 737+ million products across 21 categories
- 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price
- 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members)
- 🔒 **Secure Payments** — Trusted payment options with buyer protection
- ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews

**Shop now:** [https://www.desertcart.gr/products/8081420-analytic-combinatorics](https://www.desertcart.gr/products/8081420-analytic-combinatorics)

---

*Product available on Desertcart Greece*
*Store origin: GR*
*Last updated: 2026-02-20*