Paul Pritchard

According to our database1, Paul Pritchard
  • authored at least 23 papers between 1976 and 2000.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2000
Fast Association Discovery in Derivative Transaction Collections.
Knowl. Inf. Syst., 2000

1999
On Computing the Subset Graph of a Collection of Sets.
J. Algorithms, 1999

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

Knowledge Network Based Association Discovery (Preliminary Version).
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Mining Significant Association Rules (Short Version).
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

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

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

1994
Improved incremental prime number sieves.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1991
Algorithms for Finding Matrix Models of Propositional Calculi.
J. Autom. Reasoning, 1991

Opportunistic Algorithms for Eliminating Supersets.
Acta Inf., 1991

1990
Tutorial on Computing Models of Propositional Logics.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1989
A Display-oriented Syntax Notation.
Structured Programming, 1989

1987
Linear Prime-Number Sieves: A Family Tree.
Sci. Comput. Program., 1987

1984
Some Negative Results Concerning Prime Number Generators.
Commun. ACM, 1984

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

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

1982
Explaining the Wheel Sieve.
Acta Inf., 1982

1981
A Sublinear Additive Sieve for Finding Prime Numbers.
Commun. ACM, 1981

Another Look at the "Longest Ascending Subsequence" Problem.
Acta Inf., 1981

1979
Comments on a paper by neuhold and studer.
Computing, 1979

On the Prime Example of Programming.
Proceedings of the Language Design and Programming Methodology, 1979

1977
Program Proving-Expression Languages.
IFIP Congress, 1977

1976
A Proof Rule for Multiple Coroutine Systems.
Inf. Process. Lett., 1976


  Loading...