Deterministic Parallel Algorithms

Deterministic Parallel Algorithms is a computational model in parallel complexity theory that belongs to the class of parallel algorithms characterized by producing identical output for a given input across all executions, distinguished from probabilistic or nondeterministic variants by its reliance solely on deterministic transitions and absence of random choices during computation.

90

Publications

5.9K

Citations

190

Authors

97

Institutions

Publications per year

2017–2026

8

Authors

190

  1. NA
    Noga Alon

    Tel Aviv University, Israel

    3 publications · 247 citations

    3

    h-index

  2. RL
    Robert L. Bocchino

    University of Illinois Urbana-Champaign, United States

    3 publications · 598 citations

    3

    h-index

  3. JO
    Jeffrey Overbey

    University of Illinois Urbana-Champaign, United States

    3 publications · 598 citations

    3

    h-index

  4. NM
    Nimrod Megiddo

    IBM Research - Almaden, United States

    3 publications · 88 citations

    3

    h-index

  5. VA
    Vikram Adve

    University of Illinois Urbana-Champaign, United States

    3 publications · 598 citations

    3

    h-index

1–5 of 190

Venues

  1. SIAM Journal on Computing

    9 publications · 272 citations

    9

    h-index

  2. ACM SIGPLAN Notices

    4 publications · 390 citations

    4

    h-index

  3. Journal of Computer and System Sciences

    2 publications · 156 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 23 citations

    2

    h-index

  5. Random Structures and Algorithms

    1 publications · 193 citations

    1

    h-index

1–5