default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Pritchard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2000
[j17]Li Shen, Hong Shen, Ling Cheng, Paul Pritchard:
Fast Association Discovery in Derivative Transaction Collections. Knowl. Inf. Syst. 2(2): 147-160 (2000)- 1999
- [j16]Paul Pritchard:
A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. Algorithmica 24(1): 76-86 (1999) - [j15]Paul Pritchard:
On Computing the Subset Graph of a Collection of Sets. J. Algorithms 33(2): 187-203 (1999) - 1997
- [j14]Paul Pritchard:
An Old Sub-Quadratic Algorithm for Finding Extremal Sets. Inf. Process. Lett. 62(6): 329-334 (1997) - 1995
- [j13]Paul Pritchard:
A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order. Inf. Process. Lett. 56(6): 337-341 (1995) - 1991
- [j12]Paul Pritchard:
Opportunistic Algorithms for Eliminating Supersets. Acta Informatica 28(8): 733-754 (1991) - [j11]Paul Pritchard:
Algorithms for Finding Matrix Models of Propositional Calculi. J. Autom. Reason. 7(4): 475-487 (1991) - 1989
- [j10]Paul Pritchard:
A Display-oriented Syntax Notation. Struct. Program. 10(3): 165-168 (1989) - 1987
- [j9]Paul Pritchard:
Linear Prime-Number Sieves: A Family Tree. Sci. Comput. Program. 9(1): 17-35 (1987) - 1984
- [j8]Paul Pritchard:
Some Negative Results Concerning Prime Number Generators. Commun. ACM 27(1): 53-57 (1984) - 1983
- [j7]Paul Pritchard:
Fast Compact Prime Number Sieves (among Others). J. Algorithms 4(4): 332-344 (1983) - [j6]Paul Pritchard:
A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression. Sci. Comput. Program. 3(1): 37-63 (1983) - 1982
- [j5]Paul Pritchard:
Explaining the Wheel Sieve. Acta Informatica 17: 477-485 (1982) - 1981
- [j4]Paul Pritchard:
Another Look at the "Longest Ascending Subsequence" Problem. Acta Informatica 16: 87-91 (1981) - [j3]Paul Pritchard:
A Sublinear Additive Sieve for Finding Prime Numbers. Commun. ACM 24(1): 18-23 (1981) - 1979
- [j2]Paul Pritchard:
Comments on a paper by neuhold and studer. Computing 22(3): 279-282 (1979) - 1976
- [j1]Paul Pritchard:
A Proof Rule for Multiple Coroutine Systems. Inf. Process. Lett. 4(6): 141-143 (1976)
Conference and Workshop Papers
- 1999
- [c6]Jiuyong Li, Hong Shen, Paul Pritchard:
Mining Significant Association Rules (Short Version). PDPTA 1999: 1458-1461 - [c5]Jiuyong Li, Hong Shen, Paul Pritchard:
Knowledge Network Based Association Discovery (Preliminary Version). PDPTA 1999: 1558-1563 - 1994
- [c4]Paul Pritchard:
Improved incremental prime number sieves. ANTS 1994: 280-288 - 1990
- [c3]Paul Pritchard, John K. Slaney:
Tutorial on Computing Models of Propositional Logics. CADE 1990: 685 - 1979
- [c2]Paul Pritchard:
On the Prime Example of Programming. Language Design and Programming Methodology 1979: 85-94 - 1977
- [c1]Paul Pritchard:
Program Proving-Expression Languages. IFIP Congress 1977: 727-731
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:59 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:
