Reference

ACM问题类型

Dynamic Programming
Greedy
Complete Search
Flood Fill
Shortest Path
Recursive Search Techniques
Minimum Spanning Tree
Knapsack
Computational Geometry
Network Flow
Eulerian Path
Two-Dimensional Convex Hull
BigNums
Heuristic Search
Approximate Search
Ad Hoc Problems

Probability on Graphs - Random Processes on Graphs and Lattices by Geoffrey Grimmett, University of Cambridge

The Geometry Junkyard

How to Read Mathematics

Compact C++ Language Summary

Computational Complexity: A Modern Approach

Richard P. Stanley Home Page
Hyperplane Arrangements lecture notes

Data Structures for Information Systems , Eitan Gurari
Programming Challenges Lecture Notes

Data Structures for Text Sequences

E-Books Directory

Combinatorial Software and Databases

Percolation and Random Graphs