A Proof Rule for Multiple Coroutine Systems. - Paul Pritchard (Inf. Process. Lett., 1976)

Program Proving-Expression Languages. - Paul Pritchard (IFIP Congress, 1977)

On the Prime Example of Programming. - Paul Pritchard (Language Design and Programming Methodology, 1979)

Comments on a paper by neuhold and studer. - Paul Pritchard (Computing, 1979)

Another Look at the "Longest Ascending Subsequence" Problem. - Paul Pritchard (Acta Informatica, 1981)

A Sublinear Additive Sieve for Finding Prime Numbers. - Paul Pritchard (Commun. ACM, 1981)

Explaining the Wheel Sieve. - Paul Pritchard (Acta Informatica, 1982)

Fast Compact Prime Number Sieves (among Others). - Paul Pritchard (J. Algorithms, 1983)

A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression. - Paul Pritchard (Sci. Comput. Program., 1983)

Some Negative Results Concerning Prime Number Generators. - Paul Pritchard (Commun. ACM, 1984)

Linear Prime-Number Sieves: A Family Tree. - Paul Pritchard (Sci. Comput. Program., 1987)

A Display-oriented Syntax Notation. - Paul Pritchard (Struct. Program., 1989)

Tutorial on Computing Models of Propositional Logics. - Paul Pritchard; John K. Slaney (CADE, 1990)

Opportunistic Algorithms for Eliminating Supersets. - Paul Pritchard (Acta Informatica, 1991)

Algorithms for Finding Matrix Models of Propositional Calculi. - Paul Pritchard (J. Autom. Reason., 1991)

Improved incremental prime number sieves. - Paul Pritchard (ANTS, 1994)

A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order. - Paul Pritchard (Inf. Process. Lett., 1995)

An Old Sub-Quadratic Algorithm for Finding Extremal Sets. - Paul Pritchard (Inf. Process. Lett., 1997)

Mining Significant Association Rules (Short Version). - Jiuyong Li; Hong Shen; Paul Pritchard (PDPTA, 1999)

Knowledge Network Based Association Discovery (Preliminary Version). - Jiuyong Li; Hong Shen; Paul Pritchard (PDPTA, 1999)

A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. - Paul Pritchard (Algorithmica, 1999)

On Computing the Subset Graph of a Collection of Sets. - Paul Pritchard (J. Algorithms, 1999)

Fast Association Discovery in Derivative Transaction Collections. - Li Shen 001; Hong Shen; Ling Cheng; Paul Pritchard (Knowl. Inf. Syst., 2000)