**Algorithms**

by Jeff Erickson

**Publisher**: University of Illinois at Urbana-Champaign 2009**Number of pages**: 765

**Description**:

This course packet includes lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois at Urbana-Champaign. For the most part, these notes assume that the reader has mastered the material covered in the first two years of a typical undergraduate computer science curriculum.

Download or read it online for free here:

**Download link**

(20MB, PDF)

## Similar books

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**16249**views)

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**AK Peters, Ltd.**

An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.

(

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

(

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

(

**26521**views)