Parallel Algorithm Design

Parallel Algorithm Design is a systematic methodology within algorithmic research that focuses on formulating computational procedures capable of executing multiple operations simultaneously, distinguished by its emphasis on decomposing tasks and orchestrating inter-process communication in distributed or concurrent environments.

5.2K

Publications

235.5K

Citations

10.1K

Authors

2.2K

Institutions

Publications per year

2017–2026

554

Authors

10.1K

  1. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    25 publications · 1.6K citations

    18

    h-index

  2. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    22 publications · 2K citations

    17

    h-index

  3. JH
    John H. Reif

    Duke University, United States

    17 publications · 969 citations

    15

    h-index

  4. PS
    P. Sadayappan

    The Ohio State University, United States

    16 publications · 825 citations

    15

    h-index

  5. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    20 publications · 1.5K citations

    15

    h-index

1–5 of 10.1K

Venues

  1. Parallel Computing

    206 publications · 9.1K citations

    45

    h-index

  2. IEEE Transactions on Computers

    105 publications · 7.9K citations

    44

    h-index

  3. Journal of Parallel and Distributed Computing

    140 publications · 6K citations

    41

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 114 publications · 7.7K citations

    40

    h-index

  5. SIAM Journal on Scientific Computing

    41 publications · 2.6K citations

    26

    h-index

1–5