Some Reference Books for CSc 4520/6520

Algorithms Mainly dealing with algorithms, but often include complexity analysis
Basse, Computer Algorithms
Even, Graph Algorithms
Greene and Knuth, Mathematics for the Analysis of Algorithms
Horowitz and Sahni, Fundamentals of Computer Algorithms
Knuth, The Art of Computer Programming, 3 volumes
Minieke, Optimization Algorithms for Networks and Graphs
Nijenhufs and Wilf, Combinatorial Algorithms
Reingold, Nievergelt and Deo, Combinatorial Algorithms
Skeina, Algorithm Design Manual
Wells, Elements of Combinatorial Computing

NP-Completeness: Emphasizing Complexity Theory
Aho, Hopcroft and Ullman, The design and analysis of computer algorithms
Davis, Computability and Unsolvability
Garey and Johnson, Computers and Interactability: A guide to the theory of NP-Completeness (the most well-known introductory text; easy to read)
Hartmanis, Feasible computation and provable complexity properties (very difficult)
Hennie, Introduction to computability
Machtey and Young, An introduction to the general theory of algorithms
Savage, The complexity of computing

Parallel Processing:
Quinn, M. J., Parallel Computing: Theory and Practice, McGraw-Hill, NY, 1994. (A good introductory text)
J'aJ'a, J., An Introduction to Parallel Algorithms, Addison-Wesley Pub Co, Reading, MA, 1992.
F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, CA 1992.
J. H. Rief, Synthesis of Parallel Algorithms, Morgan Kaufman, San Mateo, CA, 1993.