Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

1998

Highly Cited

1998

FOUNDATIONS OF PARALLEL COMPUTING. Elements of Parallel Computing. Data Structures for Parallel Computing. Paradigms for Parallel… Expand

Highly Cited

1993

Highly Cited

1993

Abstract Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed… Expand

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

Highly Cited

1990

Highly Cited

1990

Publisher Summary
This chapter discusses parallel algorithms for shared-memory machines. Parallel computation is rapidly… Expand

Highly Cited

1986

Highly Cited

1986

Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the… Expand

Highly Cited

1986

Highly Cited

1986

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

Highly Cited

1985

Highly Cited

1985

Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand

Highly Cited

1984

Highly Cited

1984

A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south… Expand

Highly Cited

1981

Highly Cited

1981

The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even… Expand

Highly Cited

1973

Highly Cited

1973

An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf… Expand