![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Paul W. Purdom
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [c4]Nele Dexters, Paul W. Purdom, Dirk Van Gucht:
Peak-Jumping Frequent Itemset Mining Algorithms. PKDD 2006: 487-494 - [c3]Nele Dexters, Paul W. Purdom, Dirk Van Gucht:
A probability analysis for candidate-based frequent itemset algorithms. SAC 2006: 541-545 - 2005
- [j4]Paul W. Purdom, Daniel Le Berre, Laurent Simon:
A parsimony tree for the SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 343-365 (2005) - 2004
- [j3]Paul W. Purdom, Dirk Van Gucht, Dennis P. Groth:
Average-Case Performance of the Apriori Algorithm. SIAM J. Comput. 33(5): 1223-1260 (2004) - [j2]Timothy J. Rolfe, Paul W. Purdom:
An alternative problem for backtracking and bounding. ACM SIGCSE Bull. 36(4): 83-84 (2004) - [c2]Timothy J. Rolfe, Paul W. Purdom:
An alternative problem for backtracking and bounding. ITiCSE-WGR 2004: 83-84
1990 – 1999
- 1999
- [p1]Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah:
Algorithms for the Satisfiability (SAT) Problem. Handbook of Combinatorial Optimization 1999: 379-572 - 1996
- [c1]Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah:
Algorithms for the satisfiability (SAT) problem: A survey. Satisfiability Problem: Theory and Applications 1996: 19-151
1980 – 1989
- 1984
- [j1]Paul W. Purdom:
Solving Satisfiability with Less Searching. IEEE Trans. Pattern Anal. Mach. Intell. 6(4): 510-513 (1984)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 2025-01-09 13:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint