Parallel Complexity Theory

Parallel Complexity Theory is a branch of computational complexity theory that classifies computational problems according to their inherent difficulty in terms of resource requirements when solved on parallel models of computation.

224

Publications

11.5K

Citations

340

Authors

163

Institutions

Publications per year

2017–2026

13

Authors

340

  1. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    7 publications · 1.3K citations

    7

    h-index

  2. SC
    Stephen Cook

    University of Toronto, Canada

    6 publications · 535 citations

    6

    h-index

  3. JH
    John H. Reif

    Duke University, United States

    5 publications · 350 citations

    5

    h-index

  4. TH
    Torben Hagerup

    Max Planck Society, Germany

    5 publications · 263 citations

    5

    h-index

  5. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    5 publications · 456 citations

    5

    h-index

1–5 of 340

Venues

  1. SIAM Journal on Computing

    41 publications · 3.3K citations

    27

    h-index

  2. Journal of the ACM

    JACM · 9 publications · 286 citations

    9

    h-index

  3. Journal of Computer and System Sciences

    7 publications · 916 citations

    7

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 7 publications · 181 citations

    7

    h-index

  5. arXiv (Cornell University)

    Repository · 6 publications · 156 citations

    6

    h-index

1–5