Home Page of Paul W. Purdom, Jr.

I am a Professor of Computer Science and an Associate of the Cognitive Science Program at Indiana University, Bloomington. (See vita.) This page features links allowing you to access other information about myself, as well as some general info. My main interest is algorithms with fast average time for the conjunctive normal form (CNF) satisfiability problem and for other constraint satisfaction problems. I am also interested in computational biology, especially in practical algorithms for NP-complete computational biology problems.

"The Analysis of Algorithms", Paul Walton Purdom, Jr., and Cynthia A. Brown Introduction Summing Series Products and Binomials Asymptotic Approximation Simple Linear Recurrences General Linear Recurrences Full-History and Nonlinear Recurrences Multidimensional Recurrences Global Techniques Lower Bounds and NP Completeness Statistics

SAT

1. CNF Generator for Factoring Problems

Recent Technical Reports

1. Backtracking and Probing, 1993.
2. Average Time for the Full Pure Literal Rule, 1992.

My Ph. D. Students

Former Students, Ph. D. Graduates

• Click here if you want to send me an e-mail message.
• Check out departmental events.

I am a former President of the Indiana University Chapter of Sigma Xi, The Scientific Research Society.

Courses

General information sources

• CNN
• University of Minnesota Gopher

Information on HTML and WWW

• Web Developer's Virtual Library: WWW Development
• Daniel W. Connolly's Welcome Page

Genealogy Information

• List of ancestors.