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