default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Walton Purdom Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2000
[j29]Paul Walton Purdom Jr., Phillip G. Bradford, Koichiro Tamura
, Sudhir Kumar:
Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees. Bioinform. 16(2): 140-151 (2000)- 1997
- [j28]Paul Walton Purdom Jr.:
Backtracking and Random Constraint Satisfaction. Ann. Math. Artif. Intell. 20(1-4): 393-410 (1997) - [j27]Paul Walton Purdom Jr., G. Neil Haven:
Probe Order Backtracking. SIAM J. Comput. 26(2): 456-483 (1997) - 1996
- [j26]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. Nord. J. Comput. 3(3): 203-219 (1996) - 1994
- [j25]Paul Walton Purdom Jr.:
Average Time for the Full Pure Literal Rule. Inf. Sci. 78(3-4): 269-291 (1994) - 1993
- [j24]Khaled M. Bugrara, Paul Walton Purdom Jr.:
Average Time Analysis of Clause Order Backtracking. SIAM J. Comput. 22(2): 303-317 (1993) - 1991
- [j23]Paul Walton Purdom Jr.:
A practical unification algorithm. Inf. Sci. 55(1-3): 123-127 (1991) - 1989
- [j22]Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom Jr.:
Exponential Average Time for the Pure Literal Rule. SIAM J. Comput. 18(2): 409-418 (1989) - [j21]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
A New Base Change Algorithm for Permutation Groups. SIAM J. Comput. 18(5): 1037-1047 (1989) - 1988
- [j20]Khaled M. Bugrara, Paul Walton Purdom Jr.:
An Exponential Lower Bound for the Pure Literal Rule. Inf. Process. Lett. 27(4): 215-219 (1988) - 1987
- [j19]Paul Walton Purdom Jr., Cynthia A. Brown:
Polynomial-average-time satisfiability problems. Inf. Sci. 41(1): 23-42 (1987) - [j18]Paul Walton Purdom Jr., Cynthia A. Brown:
Tree Matching and Simplification. Softw. Pract. Exp. 17(2): 105-115 (1987) - 1986
- [j17]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
Experiments on alternatives to minimax. Int. J. Parallel Program. 15(2): 163-183 (1986) - 1985
- [j16]Paul Walton Purdom Jr., Cynthia A. Brown:
The Pure Literal Rule and Polynomial Average Time. SIAM J. Comput. 14(4): 943-953 (1985) - 1984
- [j15]Cynthia A. Brown, Paul Walton Purdom Jr.:
A Methodology and Notation for Compiler Front End Design. Softw. Pract. Exp. 14(4): 335-346 (1984) - 1983
- [j14]Paul Walton Purdom Jr.:
Search Rearrangement Backtracking and Polynomial Average Time. Artif. Intell. 21(1-2): 117-133 (1983) - [j13]Paul Walton Purdom Jr., Cynthia A. Brown:
An Analysis of Backtracking with Search Rearrangement. SIAM J. Comput. 12(4): 717-733 (1983) - 1982
- [j12]Allen Goldberg, Paul Walton Purdom Jr., Cynthia A. Brown:
Average Time Analyses of Simplified Davis-Putnam Procedures. Inf. Process. Lett. 15(2): 72-75 (1982) - [j11]Cynthia A. Brown, Paul Walton Purdom Jr.:
An Empirical Comparison of Backtracking Algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 4(3): 309-316 (1982) - 1981
- [j10]Paul Walton Purdom Jr., Cynthia A. Brown, Edward L. Robertson:
Backtracking with Multi-Level Dynamic Search Rearrangement. Acta Informatica 15: 99-113 (1981) - [j9]Paul Walton Purdom Jr., Cynthia A. Brown:
Parsing Extended LR(k) Grammars. Acta Informatica 15: 115-127 (1981) - [j8]Cynthia A. Brown, Paul Walton Purdom Jr.:
An Average Time Analysis of Backtracking. SIAM J. Comput. 10(3): 583-593 (1981) - 1980
- [j7]Paul Walton Purdom Jr., Cynthia A. Brown:
Semantic Routines and LR(k) Parsers. Acta Informatica 14: 299-315 (1980) - [j6]Paul Walton Purdom Jr., Cynthia A. Brown:
Exact formulas for the buddy system. Inf. Sci. 22(1): 1-18 (1980) - 1978
- [j5]Paul Walton Purdom Jr.:
Tree Size by Partial Backtracking. SIAM J. Comput. 7(4): 481-491 (1978) - 1972
- [j4]Paul Walton Purdom Jr., Edward F. Moore:
Immediate Predominators in a Directed Graph [H] (Algorithm 430). Commun. ACM 15(8): 777-778 (1972) - [j3]Harry C. Heacox Jr., Paul Walton Purdom Jr.:
Analysis of Two Time-Sharing Queueing Models. J. ACM 19(1): 70-91 (1972) - 1970
- [j2]Paul Walton Purdom Jr.:
A Transitive Closure Algorithm. BIT 10: 76-94 (1970) - [j1]Paul Walton Purdom Jr., Stephen M. Stigler:
Statistical Properties of the Buddy System. J. ACM 17(4): 683-697 (1970)
Conference and Workshop Papers
- 1996
- [c11]Paul Walton Purdom Jr., G. Neil Haven:
Backtracking and probing. Satisfiability Problem: Theory and Applications 1996: 153-209 - 1989
- [c10]Gene Cooperman, Larry Finkelstein, Paul Walton Purdom Jr.:
Fast Group Membership Using a Strong Generating Test for Permutation Groups. Computers and Mathematics 1989: 27-36 - 1988
- [c9]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. AAECC 1988: 99-110 - 1987
- [c8]Paul Walton Purdom Jr.:
Detecting Looping Simplifications. RTA 1987: 54-61 - 1986
- [c7]Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Intelligent Backtracking Using Symmetry. FJCC 1986: 576-584 - [c6]Chun-Hung Tzeng, Paul Walton Purdom Jr.:
Estimation of minimax values. ISMIS 1986: 174-182 - 1985
- [c5]Paul Walton Purdom Jr., Cynthia A. Brown:
Fast Many-to-One Matching Algorithms. RTA 1985: 407-416 - [c4]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
An Evaluation of Two Alternatives to Minimax. UAI 1985: 505-509 - 1983
- [c3]Chun-Hung Tzeng, Paul Walton Purdom Jr.:
A Theory of Game Trees. AAAI 1983: 416-419 - 1982
- [c2]Paul Walton Purdom Jr., Cynthia A. Brown:
Evaluating Search Methods Analytically. AAAI 1982: 124-127 - 1981
- [c1]Cynthia A. Brown, Paul Walton Purdom Jr.:
How to Search Efficiently. IJCAI 1981: 588-594
Informal and Other Publications
- 2013
- [i1]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
An Evaluation of Two Alternatives to Minimax. CoRR abs/1304.3445 (2013)
Coauthor Index
aka: Cynthia A. Brown
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
