Randomized Parallel Algorithms

Randomized Parallel Algorithms is a computational method that belongs to the class of parallel algorithms and is distinguished by its incorporation of randomness in its operations to achieve efficiency and correctness guarantees in parallel computation.

127

Publications

9.7K

Citations

209

Authors

109

Institutions

Publications per year

2017–2026

10

Authors

209

  1. JH
    John H. Reif

    Duke University, United States

    7 publications · 368 citations

    7

    h-index

  2. SS
    Sandeep Sen

    Indian Institute of Technology Delhi, India

    4 publications · 130 citations

    4

    h-index

  3. RM
    Richard M. Karp

    University of California, Berkeley, United States

    4 publications · 299 citations

    4

    h-index

  4. RC
    Richard Cole

    New York University, United States

    4 publications · 473 citations

    4

    h-index

  5. HG
    Hillel Gazit

    University of Southern California, United States

    4 publications · 230 citations

    4

    h-index

1–5 of 209

Venues

  1. SIAM Journal on Computing

    14 publications · 2.5K citations

    14

    h-index

  2. arXiv (Cornell University)

    Repository · 5 publications · 112 citations

    5

    h-index

  3. Journal of Parallel and Distributed Computing

    4 publications · 143 citations

    4

    h-index

  4. Journal of Algorithms

    4 publications · 968 citations

    4

    h-index

  5. Symposium on Discrete Algorithms

    Conference · 2 publications · 25 citations

    2

    h-index

1–5