Solving Satisfiability with Less Searching. - Paul W. Purdom (IEEE Trans. Pattern Anal. Mach. Intell., 1984)

Algorithms for the satisfiability (SAT) problem: A survey. - Jun Gu; Paul W. Purdom; John V. Franco; Benjamin W. Wah (Satisfiability Problem: Theory and Applications, 1996)

Algorithms for the Satisfiability (SAT) Problem. - Jun Gu; Paul W. Purdom; John V. Franco; Benjamin W. Wah (Handbook of Combinatorial Optimization, 1999)

Average-Case Performance of the Apriori Algorithm. - Paul W. Purdom; Dirk Van Gucht; Dennis P. Groth (SIAM J. Comput., 2004)

An alternative problem for backtracking and bounding. - Timothy J. Rolfe; Paul W. Purdom (ACM SIGCSE Bull., 2004)

A parsimony tree for the SAT2002 competition. - Paul W. Purdom; Daniel Le Berre; Laurent Simon 001 (Ann. Math. Artif. Intell., 2005)

Peak-Jumping Frequent Itemset Mining Algorithms. - Nele Dexters; Paul W. Purdom; Dirk Van Gucht (PKDD, 2006)

A probability analysis for candidate-based frequent itemset algorithms. - Nele Dexters; Paul W. Purdom; Dirk Van Gucht (SAC, 2006)