Paul Pritchard

According to our database, Paul Pritchard authored at least 23 papers between 1976 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

Fast Association Discovery in Derivative Transaction Collections.

Li Shen, Hong Shen, Ling Cheng, Paul Pritchard

Knowl. Inf. Syst., 2000

1999

On Computing the Subset Graph of a Collection of Sets.

Paul Pritchard

J. Algorithms, 1999

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

Paul Pritchard

Algorithmica, 1999

Knowledge Network Based Association Discovery (Preliminary Version).

Jiuyong Li, Hong Shen, Paul Pritchard

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Mining Significant Association Rules (Short Version).

Jiuyong Li, Hong Shen, Paul Pritchard

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

1997

An Old Sub-Quadratic Algorithm for Finding Extremal Sets.

Paul Pritchard

Inf. Process. Lett., 1997

1995

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

Paul Pritchard

Inf. Process. Lett., 1995

1994

Improved incremental prime number sieves.

Paul Pritchard

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1991

Algorithms for Finding Matrix Models of Propositional Calculi.

Paul Pritchard

J. Autom. Reason., 1991

Opportunistic Algorithms for Eliminating Supersets.

Paul Pritchard

Acta Informatica, 1991

1990

Tutorial on Computing Models of Propositional Logics.

Paul Pritchard, John K. Slaney

Proceedings of the 10th International Conference on Automated Deduction, 1990

1989

A Display-oriented Syntax Notation.

Paul Pritchard

Struct. Program., 1989

1987

Linear Prime-Number Sieves: A Family Tree.

Paul Pritchard

Sci. Comput. Program., 1987

1984

Some Negative Results Concerning Prime Number Generators.

Paul Pritchard

Commun. ACM, 1984

1983

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

Paul Pritchard

Sci. Comput. Program., 1983

Fast Compact Prime Number Sieves (among Others).

Paul Pritchard

J. Algorithms, 1983

1982

Explaining the Wheel Sieve.

Paul Pritchard

Acta Informatica, 1982

1981

A Sublinear Additive Sieve for Finding Prime Numbers.

Paul Pritchard

Commun. ACM, 1981

Another Look at the "Longest Ascending Subsequence" Problem.

Paul Pritchard

Acta Informatica, 1981

1979

Comments on a paper by neuhold and studer.

Paul Pritchard

Computing, 1979

On the Prime Example of Programming.

Paul Pritchard

Proceedings of the Language Design and Programming Methodology, 1979

1977

Program Proving-Expression Languages.

Paul Pritchard

Proceedings of the Information Processing, 1977

1976

A Proof Rule for Multiple Coroutine Systems.

Paul Pritchard

Inf. Process. Lett., 1976