More information:
- Problems on Algorithms, Second Edition, by Ian Parberry and William Gasarch, 2002. This supplementary textbook contains 965 problems on algorithms suitable for undergraduates, graduate students, and is indispensible to aspiring PhD students facing the Algorithms portion of the candidacy exam. (2.5MB)
- Parallel Complexity Theory, formerly published by Pitman & Wiley in 1987. This research monograph contains information on the foundations of a complexity theory for parallel computation. The author is grateful to Kathleen Weaver for scanning in this book from the hardcopy. (9.05MB)
- Lecture Notes on Algorithm Analysis and Complexity Theory, Fourth Edition, used in Ian Parberry's undergraduate algorithms class in the Department of Computer Sciences at the University of North Texas. Last updated December 2001. (1.97MB)