Search the dblp DataBase

Publications of Author

1. Paul Pritchard
   Improved incremental prime number sieves. [Citation Graph (0, 0)][DBLP]
   ANTS, 1994, pp:280-288 [Conf]
   
2. Paul Pritchard, John K. Slaney
   Tutorial on Computing Models of Propositional Logics. [Citation Graph (0, 0)][DBLP]
   CADE, 1990, pp:685- [Conf]
   
3. Paul Pritchard
   Program Proving-Expression Languages. [Citation Graph (0, 0)][DBLP]
   IFIP Congress, 1977, pp:727-731 [Conf]
   
4. Paul Pritchard
   On the Prime Example of Programming. [Citation Graph (0, 0)][DBLP]
   Language Design and Programming Methodology, 1979, pp:85-94 [Conf]
   
5. Jiuyong Li, Hong Shen, Paul Pritchard
   Mining Significant Association Rules (Short Version). [Citation Graph (0, 0)][DBLP]
   PDPTA, 1999, pp:1458-1461 [Conf]
   
6. Jiuyong Li, Hong Shen, Paul Pritchard
   Knowledge Network Based Association Discovery (Preliminary Version). [Citation Graph (0, 0)][DBLP]
   PDPTA, 1999, pp:1558-1563 [Conf]
   
7. Paul Pritchard
   Another Look at the "Longest Ascending Subsequence" Problem. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1981, v:16, n:, pp:87-91 [Journal]
   
8. Paul Pritchard
   Explaining the Wheel Sieve. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1982, v:17, n:, pp:477-485 [Journal]
   
9. Paul Pritchard
   Opportunistic Algorithms for Eliminating Supersets. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1991, v:28, n:8, pp:733-754 [Journal]
   
10. Paul Pritchard
    A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:1, pp:76-86 [Journal]
    
11. Paul Pritchard
    A Sublinear Additive Sieve for Finding Prime Numbers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:1, pp:18-23 [Journal]
    
12. Paul Pritchard
    Some Negative Results Concerning Prime Number Generators. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1984, v:27, n:1, pp:53-57 [Journal]
    
13. Paul Pritchard
    A Proof Rule for Multiple Coroutine Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:4, n:6, pp:141-143 [Journal]
    
14. Paul Pritchard
    A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:337-341 [Journal]
    
15. Paul Pritchard
    An Old Sub-Quadratic Algorithm for Finding Extremal Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:329-334 [Journal]
    
16. Paul Pritchard
    Fast Compact Prime Number Sieves (among Others). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:332-344 [Journal]
    
17. Paul Pritchard
    On Computing the Subset Graph of a Collection of Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:187-203 [Journal]
    
18. Paul Pritchard
    Algorithms for Finding Matrix Models of Propositional Calculi. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:4, pp:475-487 [Journal]
    
19. Li Shen, Hong Shen, Ling Cheng, Paul Pritchard
    Fast Association Discovery in Derivative Transaction Collections. [Citation Graph (0, 0)][DBLP]
    Knowl. Inf. Syst., 2000, v:2, n:2, pp:147-160 [Journal]
    
20. Paul Pritchard
    A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1983, v:3, n:1, pp:37-63 [Journal]
    
21. Paul Pritchard
    Linear Prime-Number Sieves: A Family Tree. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1987, v:9, n:1, pp:17-35 [Journal]
    
22. Paul Pritchard
    A Display-oriented Syntax Notation. [Citation Graph (0, 0)][DBLP]
    Structured Programming, 1989, v:10, n:3, pp:165-168 [Journal]