Paul Pritchard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2000

Fast Association Discovery in Derivative Transaction CollectionsLi Shen, Hong Shen, Ling Cheng, Paul Pritchard. kais, 2(2):147-160, 2000. [doi]

1999

Knowledge Network Based Association Discovery (Preliminary Version)Jiuyong Li, Hong Shen, Paul Pritchard. pdpta 1999: 1558-1563

Mining Significant Association Rules (Short Version)Jiuyong Li, Hong Shen, Paul Pritchard. pdpta 1999: 1458-1461

A Fast Bit-Parallel Algorithm for Computing the Subset Partial OrderPaul Pritchard. algorithmica, 24(1):76-86, 1999. [doi]

On Computing the Subset Graph of a Collection of SetsPaul Pritchard. jal, 33(2):187-203, 1999.

1997

An Old Sub-Quadratic Algorithm for Finding Extremal SetsPaul Pritchard. ipl, 62(6):329-334, 1997. [doi]

1995

A Simple Sub-Quadratic Algorithm for Computing the Subset Partial OrderPaul Pritchard. ipl, 56(6):337-341, 1995. [doi]

1994

Improved incremental prime number sievesPaul Pritchard. antsw 1994: 280-288

1991

Opportunistic Algorithms for Eliminating SupersetsPaul Pritchard. ACTA, 28(8):733-754, 1991.

Algorithms for Finding Matrix Models of Propositional CalculiPaul Pritchard. JAR, 7(4):475-487, 1991.

1990

Tutorial on Computing Models of Propositional LogicsPaul Pritchard, John K. Slaney. cade 1990: 685

1989

A Display-oriented Syntax NotationPaul Pritchard. stp, 10(3):165-168, 1989.

1987

Linear Prime-Number Sieves: A Family TreePaul Pritchard. SCP, 9(1):17-35, 1987.

1984

Some Negative Results Concerning Prime Number GeneratorsPaul Pritchard. CACM, 27(1):53-57, 1984.

1983

A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetical ProgressionPaul Pritchard. SCP, 3(1):37-63, 1983.

Fast Compact Prime Number Sieves (among Others)Paul Pritchard. jal, 4(4):332-344, 1983.

1982

Explaining the Wheel SievePaul Pritchard. ACTA, 17:477-485, 1982.

1981

Another Look at the Longest Ascending Subsequence ProblemPaul Pritchard. ACTA, 16:87-91, 1981.

A Sublinear Additive Sieve for Finding Prime NumbersPaul Pritchard. CACM, 24(1):18-23, 1981.

1979

On the Prime Example of ProgrammingPaul Pritchard. ldpm 1980: 85-94

Comments on a paper by neuhold and studerPaul Pritchard. computing, 22(3):279-282, 1979. [doi]

1977

Program Proving-Expression LanguagesPaul Pritchard. ifip11-9 1977: 727-731

1976

A Proof Rule for Multiple Coroutine SystemsPaul Pritchard. ipl, 4(6):141-143, 1976.

Sign in or sign up to see more results.

runs on WebDSL