Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2006

Highly Cited

2006

Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences… Expand

Is this relevant?

1998

1998

Abstract The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing… Expand

Is this relevant?

1996

1996

The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for general… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Hierarchical clustering is common method used to determine clusters of similar data points in multi-dimensional spaces. $O(n^2… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The… Expand

Is this relevant?

1992

1992

Abstract We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

A study of the effects of adding two scan primitives as unit-time primitives to PRAM (parallel random access machine) models is… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

One of the frequently used models for a synchronous parallel computer is that of a parallel random access machine, where each… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand

Is this relevant?