In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can be executed a piece at a time onâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

1997

Highly Cited

1997

- Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, Wei Li
- Data Mining and Knowledge Discovery
- 1997

Discovery of association rules is an important data mining task. Several parallel and sequential algorithms have been proposed inâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Guy E. Blelloch
- Commun. ACM
- 1996

In the past 20 years there has been treftlen-dous progress in developing and analyzing parallel algorithftls. Researchers haveâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We present serial and parallel algorithms for solving a system of equations that arises from the discretization of the Hamiltonâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- S. Reed Plimpton
- 1993

Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset ofâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- David E. Culler, Richard M. Karp, +5 authors Thorsten von Eicken
- PPOPP
- 1993

A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, orâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- W. Daniel Hillis, Guy L. Steele
- Commun. ACM
- 1986

Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to theâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Noga Alon, LÃ¡szlÃ³ Babai, Alon Itai
- J. Algorithms
- 1986

A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Itsâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- Richard M. Karp, Avi Wigderson
- STOC
- 1984

A parallel algorithm is presented that accepts as input a graph <italic>G</italic> and produces a maximal independent set ofâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Nimrod Megiddo
- 22nd Annual Symposium on Foundations of Computerâ€¦
- 1981

The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications evenâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Peter M. Kogge, Harold S. Stone
- IEEE Trans. Computers
- 1973

An mnth-order recurrence problem is defined as the compurirst order, all linear mth-order recurrence equations can be cast intoâ€¦Â (More)

Is this relevant?