25,161
edits
Changes
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..."
'''[[Main Page|Home]] * [[People]] * Paul W. Purdom'''
[[FILE:paulwpurdom.jpg|border|right|thumb|link=https://legacy.cs.indiana.edu/~pwp/| Paul W. Purdom <ref>[https://legacy.cs.indiana.edu/~pwp/ Home Page of Paul W. Purdom, Jr.]</ref> ]]
'''Paul W. Purdom, Jr.''',<br/>
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]],
and [https://en.wikipedia.org/wiki/Computational_biology computational biology], especially in practical algorithms for NP-complete computational biology problems.
=Selected Publications=
<ref>[https://dblp.org/pid/74/5420.html dblp: Paul Walton Purdom Jr.]</ref>
==1970 ...==
* [[Paul W. Purdom]], [[Mathematician#SMStigler|Stephen M. Stigler]] ('''1970'''). ''[https://www.semanticscholar.org/paper/Statistical-Properties-of-the-Buddy-System-Purdom-Stigler/36ffdc1a3960dd9874d676176d1e4bd48c99b528 Statistical Properties of the Buddy System]''. [[ACM#Journal|Journal of the ACM]], Vol. 17, No. 4 <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
* [[Paul W. Purdom]] ('''1970'''). ''[https://link.springer.com/article/10.1007/BF01940892 A Transitive Closure Algorithm]''. [https://dblp.org/db/journals/bit/bit10.html#Purdom70 BIT, Vol. 10]
* [[Mathematician#HCHeacox|Harry C. Heacox]], [[Paul W. Purdom]] ('''1972'''). ''[https://dl.acm.org/doi/10.1145/321679.321686 Analysis of two time-sharing queueing models]''. [[ACM#Journal|Journal of the ACM]], Vol. 19, No. 1
* [[Paul W. Purdom]] ('''1978'''). ''[https://epubs.siam.org/doi/abs/10.1137/0207038?journalCode=smjcat Tree Size by Partial Backtracking]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 7, No. 4
==1980 ...==
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1980'''). ''[https://www.semanticscholar.org/paper/Exact-formulas-for-the-buddy-system-Purdom-Brown/edb813045099fe0e657d20e2c7d5b54ddbb9fbcd Exact formulas for the buddy system]''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 22, No. 1
* [[Mathematician#CABrown|Cynthia A. Brown]], [[Paul W. Purdom]] ('''1981'''). ''How to Search Efficiently''. [[Conferences#IJCAI1981|IJCAI 1981]], [https://www.ijcai.org/Proceedings/81-1/Papers/106.pdf pdf]
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]], [[Mathematician#ELRobertson|Edward L. Robertson]] ('''1981'''). ''Backtracking with Multi-Level Dynamic Search Rearrangement''. [http://ftp.math.utah.edu/pub//tex/bib/toc/actainfo.html#15%282%29:December:1981 Acta Informatica Vol. 15, No. 2]
* [[Chun-Hung Tzeng]], [[Paul W. Purdom]] ('''1983'''). ''[https://www.aaai.org/Library/AAAI/1983/aaai83-080.php A Theory of Game Trees]''. [[Conferences#AAAI-83|AAAI-83]]
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1985'''). ''The Analysis of Algorithms''. [https://en.wikipedia.org/wiki/Holt_McDougal#History Holt, Rinehart and Winston]
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''1986'''). ''Experiments on Alternatives to Minimax''. [https://dblp.uni-trier.de/db/journals/ijpp/ijpp15.html#NauPT86 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, [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
==1990 ...==
* [[Paul W. Purdom]] ('''1991'''). ''[https://www.sciencedirect.com/science/article/abs/pii/002002559190009J A practical unification algorithm]''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 55, Nos. 1-3 <ref>[https://en.wikipedia.org/wiki/Unification_(computer_science) Unification from Wikipedia]</ref>
* [[Paul W. Purdom]], [https://dblp.uni-trier.de/pid/15/2493.html G. Neil Haven] ('''1996'''). ''Backtracking and Probing''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs35.html#PurdomH96 Satisfiability Problem: Theory and Applications 1996], [https://www.academia.edu/22023319/Backtracking_and_probing pdf]
* [[Paul W. Purdom]] ('''1997'''). ''[https://link.springer.com/article/10.1023/A:1018944814355 Backtracking and Random Constraint Satisfaction]''. [https://www.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 20
==2000 ...==
* [[Paul W. Purdom]], [https://dblp.org/pid/68/134.html Phillip G. Bradford], [https://dblp.org/pid/45/3752.html Koichiro Tamura], [https://dblp.org/pid/25/5174-1.html Sudhir Kumar] ('''2000'''). ''[https://academic.oup.com/bioinformatics/article/16/2/140/232038 Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees]''. [https://en.wikipedia.org/wiki/Bioinformatics_(journal) Bioinformatics], Vol. 16, No. 2
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''2004'''). ''The Analysis of Algorithms''. [https://en.wikipedia.org/wiki/Oxford_University_Press Oxford University Press], [https://www.amazon.com/Analysis-Algorithms-Paul-Purdom-Jr/dp/0195174798 amazon]
==2010 ...==
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''2013'''). ''An Evaluation of Two Alternatives to Minimax''. [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
=External Links=
* [https://legacy.cs.indiana.edu/~pwp/ Home Page of Paul W. Purdom, Jr.]
* [https://www.mathgenealogy.org/id.php?id=82489 Paul Walton Purdom, Jr. - The Mathematics Genealogy Project]
* [https://citations.cogs.indiana.edu/profile.php?faculty=pwp Paul Purdom: Cognitive Science Program: Indiana University Bloomington]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Physicist|Purdom]]
[[Category:Researcher|Purdom]]
[[FILE:paulwpurdom.jpg|border|right|thumb|link=https://legacy.cs.indiana.edu/~pwp/| Paul W. Purdom <ref>[https://legacy.cs.indiana.edu/~pwp/ Home Page of Paul W. Purdom, Jr.]</ref> ]]
'''Paul W. Purdom, Jr.''',<br/>
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]],
and [https://en.wikipedia.org/wiki/Computational_biology computational biology], especially in practical algorithms for NP-complete computational biology problems.
=Selected Publications=
<ref>[https://dblp.org/pid/74/5420.html dblp: Paul Walton Purdom Jr.]</ref>
==1970 ...==
* [[Paul W. Purdom]], [[Mathematician#SMStigler|Stephen M. Stigler]] ('''1970'''). ''[https://www.semanticscholar.org/paper/Statistical-Properties-of-the-Buddy-System-Purdom-Stigler/36ffdc1a3960dd9874d676176d1e4bd48c99b528 Statistical Properties of the Buddy System]''. [[ACM#Journal|Journal of the ACM]], Vol. 17, No. 4 <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
* [[Paul W. Purdom]] ('''1970'''). ''[https://link.springer.com/article/10.1007/BF01940892 A Transitive Closure Algorithm]''. [https://dblp.org/db/journals/bit/bit10.html#Purdom70 BIT, Vol. 10]
* [[Mathematician#HCHeacox|Harry C. Heacox]], [[Paul W. Purdom]] ('''1972'''). ''[https://dl.acm.org/doi/10.1145/321679.321686 Analysis of two time-sharing queueing models]''. [[ACM#Journal|Journal of the ACM]], Vol. 19, No. 1
* [[Paul W. Purdom]] ('''1978'''). ''[https://epubs.siam.org/doi/abs/10.1137/0207038?journalCode=smjcat Tree Size by Partial Backtracking]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 7, No. 4
==1980 ...==
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1980'''). ''[https://www.semanticscholar.org/paper/Exact-formulas-for-the-buddy-system-Purdom-Brown/edb813045099fe0e657d20e2c7d5b54ddbb9fbcd Exact formulas for the buddy system]''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 22, No. 1
* [[Mathematician#CABrown|Cynthia A. Brown]], [[Paul W. Purdom]] ('''1981'''). ''How to Search Efficiently''. [[Conferences#IJCAI1981|IJCAI 1981]], [https://www.ijcai.org/Proceedings/81-1/Papers/106.pdf pdf]
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]], [[Mathematician#ELRobertson|Edward L. Robertson]] ('''1981'''). ''Backtracking with Multi-Level Dynamic Search Rearrangement''. [http://ftp.math.utah.edu/pub//tex/bib/toc/actainfo.html#15%282%29:December:1981 Acta Informatica Vol. 15, No. 2]
* [[Chun-Hung Tzeng]], [[Paul W. Purdom]] ('''1983'''). ''[https://www.aaai.org/Library/AAAI/1983/aaai83-080.php A Theory of Game Trees]''. [[Conferences#AAAI-83|AAAI-83]]
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''1985'''). ''The Analysis of Algorithms''. [https://en.wikipedia.org/wiki/Holt_McDougal#History Holt, Rinehart and Winston]
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''1986'''). ''Experiments on Alternatives to Minimax''. [https://dblp.uni-trier.de/db/journals/ijpp/ijpp15.html#NauPT86 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, [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
==1990 ...==
* [[Paul W. Purdom]] ('''1991'''). ''[https://www.sciencedirect.com/science/article/abs/pii/002002559190009J A practical unification algorithm]''. [https://en.wikipedia.org/wiki/Information_Sciences_(journal) Information Sciences], Vol. 55, Nos. 1-3 <ref>[https://en.wikipedia.org/wiki/Unification_(computer_science) Unification from Wikipedia]</ref>
* [[Paul W. Purdom]], [https://dblp.uni-trier.de/pid/15/2493.html G. Neil Haven] ('''1996'''). ''Backtracking and Probing''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs35.html#PurdomH96 Satisfiability Problem: Theory and Applications 1996], [https://www.academia.edu/22023319/Backtracking_and_probing pdf]
* [[Paul W. Purdom]] ('''1997'''). ''[https://link.springer.com/article/10.1023/A:1018944814355 Backtracking and Random Constraint Satisfaction]''. [https://www.springer.com/journal/10472 Annals of Mathematics and Artificial Intelligence], Vol. 20
==2000 ...==
* [[Paul W. Purdom]], [https://dblp.org/pid/68/134.html Phillip G. Bradford], [https://dblp.org/pid/45/3752.html Koichiro Tamura], [https://dblp.org/pid/25/5174-1.html Sudhir Kumar] ('''2000'''). ''[https://academic.oup.com/bioinformatics/article/16/2/140/232038 Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees]''. [https://en.wikipedia.org/wiki/Bioinformatics_(journal) Bioinformatics], Vol. 16, No. 2
* [[Paul W. Purdom]], [[Mathematician#CABrown|Cynthia A. Brown]] ('''2004'''). ''The Analysis of Algorithms''. [https://en.wikipedia.org/wiki/Oxford_University_Press Oxford University Press], [https://www.amazon.com/Analysis-Algorithms-Paul-Purdom-Jr/dp/0195174798 amazon]
==2010 ...==
* [[Dana S. Nau]], [[Paul W. Purdom]], [[Chun-Hung Tzeng]] ('''2013'''). ''An Evaluation of Two Alternatives to Minimax''. [https://arxiv.org/abs/1304.3445 arXiv:1304.3445]
=External Links=
* [https://legacy.cs.indiana.edu/~pwp/ Home Page of Paul W. Purdom, Jr.]
* [https://www.mathgenealogy.org/id.php?id=82489 Paul Walton Purdom, Jr. - The Mathematics Genealogy Project]
* [https://citations.cogs.indiana.edu/profile.php?faculty=pwp Paul Purdom: Cognitive Science Program: Indiana University Bloomington]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Physicist|Purdom]]
[[Category:Researcher|Purdom]]
