Work

Communication-efficient parallel algorithms for distributed random-access machines

Year: 1988

Type: article

Source: Algorithmica

DOI: 10.1007/bf01762110

Authors: Charles E. Leiserson, Bruce M. Maggs

Institution: Massachusetts Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1971262016

FWCI: 3.744

Cites: 32

Cited by: 71

Related to: 10