Computer Science
Introduction to Algorithms
Publisher: MIT Press, 2003, 1056pp, 2nd ed.
Both rigorous and complete, Cormen's introductory textbook covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms.