Parallel Time Complexity

Parallel Time Complexity is the computational complexity measure that belongs to the class of time complexity metrics, specifically defined by the minimum number of parallel computation steps required by a parallel algorithm to solve a problem on a given parallel computational model.

302

Publications

11.9K

Citations

647

Authors

314

Institutions

Publications per year

2017–2026

38

Authors

647

  1. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    6 publications · 431 citations

    6

    h-index

  2. JH
    John H. Reif

    Duke University, United States

    5 publications · 136 citations

    5

    h-index

  3. VY
    Victor Y. Pan

    Lehman College, United States

    4 publications · 276 citations

    4

    h-index

  4. JS
    Julian Shun

    Carnegie Mellon University, United States

    4 publications · 122 citations

    4

    h-index

  5. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    4 publications · 77 citations

    4

    h-index

1–5 of 647

Venues

  1. SIAM Journal on Computing

    17 publications · 863 citations

    13

    h-index

  2. IEEE Transactions on Computers

    14 publications · 591 citations

    13

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 11 publications · 413 citations

    11

    h-index

  4. arXiv (Cornell University)

    Repository · 8 publications · 249 citations

    8

    h-index

  5. Information and Computation

    5 publications · 196 citations

    5

    h-index

1–5