Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

Lecture Notes

Set of lecture notes for the algorithms classes required for all computer science undergraduate and graduate students at the University of Illinois, Urbana-Champaign.

Related Content

Added |
14 Feb 2009 |

Updated |
14 Feb 2009 |

Year |
2000 |

Authors |
Jeff Erickson |

Solving recurrences

Recursion

Divide and conquer

Fast Fourier transforms

Dynamic programming

Greedy algorithms

Nuts and bolts (randomized quicksort)

Treaps and skip lists

Uniform and universal hashing

Aggregation, taxation, potential

Scapegoat trees and splay trees

Maintaining disjoint sets ("union-find")

Fibonacci heaps

Representations, traversal

Minimum spanning trees

Single-source shortest paths

All-pairs shortest paths

Maximum flows and minimum cuts

Maximum flow algorithms and applications

Randomized minimum cuts

Number-theoretic algorithms

Brute force, fingerprinting

Knuth-Morris-Pratt

Computational geometry: convex hulls

Line segment intersection

Polygon triangulation

Decision trees, leaf counting

Adversary arguments ("n-card monte")

Reductions

NP-hardness

Approximation algorithms

J. Definitions and duality

K. The simplex algorithm

Comments (0)