| Algorithms for the satisfiability (SAT) problem: A survey. J Gu, PW Purdom, J Franco, BW Wah Satisfiability problem: Theory and applications 35, 19-152, 1996 | 509 | 1996 |
| A sentence generator for testing parsers P Purdom BIT Numerical Mathematics 12, 366-375, 1972 | 325 | 1972 |
| Search rearrangement backtracking and polynomial average time PW Purdom Jr Artificial intelligence 21 (1-2), 117-133, 1983 | 273 | 1983 |
| The analysis of algorithms PW Purdom, CA Brown Holt, Rinehart and Winston, 1985 | 246 | 1985 |
| A transitive closure algorithm P Purdom Jr BIT Numerical Mathematics 10 (1), 76-94, 1970 | 169 | 1970 |
| Average time analysis of simplified Davis-Putnam procedures A Goldberg, P Purdom, C Brown Information Processing Letters 15 (2), 72-75, 1982 | 155 | 1982 |
| An average time analysis of backtracking CA Brown, PW Purdom, Jr SIAM Journal on Computing 10 (3), 583-593, 1981 | 119 | 1981 |
| Backtrack searching in the presence of symmetry CA Brown, L Finkelstein, PW Purdom Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 6th …, 1989 | 115 | 1989 |
| Tree size by partial backtracking PW Purdom SIAM Journal on Computing 7 (4), 481-491, 1978 | 94 | 1978 |
| The pure literal rule and polynomial average time PW Purdom, Jr, CA Brown SIAM Journal on Computing 14 (4), 943-953, 1985 | 91 | 1985 |
| Algorithm 430 [H]: Immediate predominators in a directed graph PW Purdom Jr, EF Moore Communications of the ACM 15 (8), 777-778, 1972 | 90 | 1972 |
| Backtracking with multi-level dynamic search rearrangement PW Purdom, CA Brown, EL Robertson Acta Informatica 15, 99-113, 1981 | 67 | 1981 |
| Polynomial-average-time satisfiability problems PW Purdom Jr, CA Brown Information Sciences 41 (1), 23-42, 1987 | 60 | 1987 |
| An analysis of backtracking with search rearrangement PW Purdom, Jr, CA Brown SIAM Journal on Computing 12 (4), 717-733, 1983 | 60 | 1983 |
| Statistical properties of the buddy system PW Purdom Jr, SM Stigler Journal of the ACM (JACM) 17 (4), 683-697, 1970 | 58 | 1970 |
| Average-case performance of the apriori algorithm PW Purdom, D Van Gucht, DP Groth SIAM Journal on Computing 33 (5), 1223-1260, 2004 | 52 | 2004 |
| Solving satisfiability with less searching PW Purdom IEEE transactions on pattern analysis and machine intelligence, 510-513, 1984 | 50 | 1984 |
| Semantic routines and LR(k) parsers P Purdom, CA Brown Acta Informatica 14, 299-315, 1980 | 49 | 1980 |
| A Survey of Average Time Analyses of P Purdom Journal of Information Processing 13 (4), 1990 | 48 | 1990 |
| Parsing extended LR(k) grammars PW Purdom, CA Brown Acta Informatica 15, 115-127, 1981 | 40 | 1981 |
