Pram Algorithms

PRAM Algorithms is a class of parallel algorithms designed for the Parallel Random Access Machine model, distinguished by their assumption of simultaneous access to a shared memory by multiple processors without contention.

172

Publications

11.6K

Citations

268

Authors

113

Institutions

Publications per year

2017–2026

10

Variants

Parallel Random Access Machine Algorithms

Authors

268

  1. YM
    Yossi Matias

    Google (United States), United States

    9 publications · 322 citations

    9

    h-index

  2. PB
    Phillip B. Gibbons

    Carnegie Mellon University, United States

    7 publications · 525 citations

    7

    h-index

  3. TH
    Torben Hagerup

    Max Planck Society, Germany

    7 publications · 257 citations

    7

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    6 publications · 323 citations

    6

    h-index

  5. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    6 publications · 249 citations

    6

    h-index

1–5 of 268

Venues

  1. SIAM Journal on Computing

    15 publications · 1.3K citations

    13

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 6 publications · 163 citations

    6

    h-index

  3. Journal of the ACM

    JACM · 5 publications · 257 citations

    5

    h-index

  4. arXiv (Cornell University)

    Repository · 5 publications · 64 citations

    5

    h-index

  5. Information Processing Letters

    4 publications · 99 citations

    4

    h-index

1–5