Paul Pritchard

发表

Fast Association Discovery in Derivative Transaction Collections

Li Shen, Hong Shen, Ling Cheng, 2000, Knowledge and Information Systems.

A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical Progression

Paul Pritchard, P. Pritchard, 1982, Sci. Comput. Program..

A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order

Paul Pritchard, 1999, Algorithmica.

Decommissioning and Demolition of a Redundant UK Research Facility at AWE Aldermaston - 12453

Paul Pritchard, 2012 .

Program Proving-Expression Languages

Paul Pritchard, 1977, IFIP Congress.

Environmental Risk Management

Paul Pritchard, P. Pritchard, 2000 .

A problem involving subsequences

Paul Pritchard, 1990 .

Finding the N largest itemsets

Paul Pritchard, Rodney W. Topor, Li Shen, 1970 .

Comments on a paper by neuhold and studer

Paul Pritchard, 2005, Computing.

Algorithms for finding matrix models of propositional calculi

Paul Pritchard, P. Pritchard, 1991, Journal of Automated Reasoning.

Mining Significant Association Rules (Short Version)

Hong Shen, Paul Pritchard, Jiuyong Li, 1999, PDPTA.

Opportunistic algorithms for eliminating supersets

Paul Pritchard, P. Pritchard, 1991, Acta Informatica.

Programming Techniques and Data Structures a Sublinear Additive Sieve for Finding Prime Numbers

Paul Pritchard, P. Pritchard, M. D. Mcllroy Editor, 2022 .

Quantifying Operational Risk Guided by Kernel Smoothing and Continuous Credibility: A Practitioners View

Paul Pritchard, Jens Perch Nielsen, Jim Gustafsson, 2006 .

Explaining the wheel sieve

Paul Pritchard, P. Pritchard, 1982, Acta Informatica.

An Introduction to Programming Using MacIntosh Pascal

Paul Pritchard, 1988 .

A Display-oriented Syntax Notation

Paul Pritchard, 1989, Struct. Program..

Tutorial on Computing Models of Propositional Logics

Paul Pritchard, John K. Slaney, 1990, CADE.

Computing models of propositional logics (tutorial)

Paul Pritchard, John Slaney, 1990 .

Quantifying Operational Risk Guided by Kernel Smoothing and Continuous Credibility

Paul Pritchard, Jens Perch Nielsen, Jim Gustafsson, 2005 .

Linear Prime-Number Sieves: A Family Tree

Paul Pritchard, 1987, Sci. Comput. Program..

A Proof Rule for Multiple Coroutine Systems

Paul Pritchard, P. Pritchard, 1976, Inf. Process. Lett..

Knowledge Network Based Association Discovery (Preliminary Version)

Hong Shen, Paul Pritchard, Jiuyong Li, 1999, PDPTA.

On the Prime Example of Programming

Paul Pritchard, 1979, Language Design and Programming Methodology.

On Computing the Subset Graph of a Collection of Sets

Paul Pritchard, 1999, J. Algorithms.

Improved incremental prime number sieves

Paul Pritchard, 1994, ANTS.

Another look at the “longest ascending subsequence” problem

Paul Pritchard, 2004, Acta Informatica.

Managing environmental risks and liabilities

Paul Pritchard, 1994 .

An Old Sub-Quadratic Algorithm for Finding Extremal Sets

Paul Pritchard, 1997, Inf. Process. Lett..

Some negative results concerning prime number generators

Paul Pritchard, 1984, CACM.

Fast Compact Prime Number Sieves (among Others)

Paul Pritchard, P. Pritchard, 1984, J. Algorithms.

A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order

Paul Pritchard, P. Pritchard, 1995, Inf. Process. Lett..

The Seven-Eleven Problem

Paul Pritchard, David Gries, 1983 .