Difference between revisions of "Paul W. Purdom"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Paul W. Purdom''' FILE:paulwpurdom.jpg|border|right|thumb|link=https://legacy.cs.indiana.edu/~pwp/| Paul W. Purdom <ref>[https://legacy...") |
GerdIsenberg (talk | contribs) |
||
| Line 6: | Line 6: | ||
an American computer scientist and professor emeritus at [https://en.wikipedia.org/wiki/Indiana_University_Bloomington Indiana University Bloomington] <ref>[https://citations.cogs.indiana.edu/profile.php?faculty=pwp Paul Purdom: Cognitive Science Program: Indiana University Bloomington]</ref>. | an American computer scientist and professor emeritus at [https://en.wikipedia.org/wiki/Indiana_University_Bloomington Indiana University Bloomington] <ref>[https://citations.cogs.indiana.edu/profile.php?faculty=pwp Paul Purdom: Cognitive Science Program: Indiana University Bloomington]</ref>. | ||
His research interests include algorithms with fast average time for the [https://en.wikipedia.org/wiki/Conjunctive_normal_form conjunctive normal form (CNF)] [https://en.wikipedia.org/wiki/Satisfiability satisfiability problem], [[Backtracking|backtracking]], [[Search|game tree search]] along with probabilistic game models, [[Product Propagation|product propagation]] and [[Search Pathology|pathology]], | His research interests include algorithms with fast average time for the [https://en.wikipedia.org/wiki/Conjunctive_normal_form conjunctive normal form (CNF)] [https://en.wikipedia.org/wiki/Satisfiability satisfiability problem], [[Backtracking|backtracking]], [[Search|game tree search]] along with probabilistic game models, [[Product Propagation|product propagation]] and [[Search Pathology|pathology]], | ||
| − | and [https://en.wikipedia.org/wiki/Computational_biology computational biology], especially in practical algorithms for NP-complete computational biology problems. | + | and [https://en.wikipedia.org/wiki/Computational_biology computational biology], especially in practical algorithms for [https://en.wikipedia.org/wiki/NP-completeness NP-complete] computational biology problems. |
=Selected Publications= | =Selected Publications= | ||
| Line 41: | Line 41: | ||
<references /> | <references /> | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| − | |||
[[Category:Researcher|Purdom]] | [[Category:Researcher|Purdom]] | ||
Latest revision as of 22:28, 4 April 2021
Home * People * Paul W. Purdom
Paul W. Purdom [1]
Paul W. Purdom, Jr.,
an American computer scientist and professor emeritus at Indiana University Bloomington [2].
His research interests include algorithms with fast average time for the conjunctive normal form (CNF) satisfiability problem, backtracking, game tree search along with probabilistic game models, product propagation and pathology,
and computational biology, especially in practical algorithms for NP-complete computational biology problems.
Contents
Selected Publications
1970 ...
- Paul W. Purdom, Stephen M. Stigler (1970). Statistical Properties of the Buddy System. Journal of the ACM, Vol. 17, No. 4 [4]
- Paul W. Purdom (1970). A Transitive Closure Algorithm. BIT, Vol. 10
- Harry C. Heacox, Paul W. Purdom (1972). Analysis of two time-sharing queueing models. Journal of the ACM, Vol. 19, No. 1
- Paul W. Purdom (1978). Tree Size by Partial Backtracking. SIAM Journal on Computing, Vol. 7, No. 4
1980 ...
- Paul W. Purdom, Cynthia A. Brown (1980). Exact formulas for the buddy system. Information Sciences, Vol. 22, No. 1
- Cynthia A. Brown, Paul W. Purdom (1981). How to Search Efficiently. IJCAI 1981, pdf
- Paul W. Purdom, Cynthia A. Brown, Edward L. Robertson (1981). Backtracking with Multi-Level Dynamic Search Rearrangement. Acta Informatica Vol. 15, No. 2
- Chun-Hung Tzeng, Paul W. Purdom (1983). A Theory of Game Trees. AAAI-83
- Paul W. Purdom, Cynthia A. Brown (1985). The Analysis of Algorithms. Holt, Rinehart and Winston
- Dana S. Nau, Paul W. Purdom, Chun-Hung Tzeng (1986). Experiments on Alternatives to Minimax. International Journal of Parallel Programming, Vol. 15, No. 2
- Dana S. Nau, Paul W. Purdom, Chun-Hung Tzeng (1986, 2013). An Evaluation of Two Alternatives to Minimax. Machine Intelligence and Pattern Recognition, Vol. 4, arXiv:1304.3445
1990 ...
- Paul W. Purdom (1991). A practical unification algorithm. Information Sciences, Vol. 55, Nos. 1-3 [5]
- Paul W. Purdom, G. Neil Haven (1996). Backtracking and Probing. Satisfiability Problem: Theory and Applications 1996, pdf
- Paul W. Purdom (1997). Backtracking and Random Constraint Satisfaction. Annals of Mathematics and Artificial Intelligence, Vol. 20
2000 ...
- Paul W. Purdom, Phillip G. Bradford, Koichiro Tamura, Sudhir Kumar (2000). Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees. Bioinformatics, Vol. 16, No. 2
- Paul W. Purdom, Cynthia A. Brown (2004). The Analysis of Algorithms. Oxford University Press, amazon
2010 ...
- Dana S. Nau, Paul W. Purdom, Chun-Hung Tzeng (2013). An Evaluation of Two Alternatives to Minimax. arXiv:1304.3445
External Links
- Home Page of Paul W. Purdom, Jr.
- Paul Walton Purdom, Jr. - The Mathematics Genealogy Project
- Paul Purdom: Cognitive Science Program: Indiana University Bloomington
