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
Parents
224
Walter L. Ruzzo · Journal of Computer and System Sciences · 1981 · 434 citations
An O(n2log n) parallel max-flow algorithm
Yossi Shiloach, Uzi Vishkin · Journal of Algorithms · 1982 · 226 citations
1–5 of 224
340
7
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 340
163
Stanford University
Stanford, United States
11 h-index
23 publications
1.4K citations
University of Washington
Seattle, United States
9 h-index
12 publications
698 citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
17 publications
644 citations
Max Planck Society
Munich, Germany
8 h-index
11 publications
482 citations

University of Toronto
Toronto, Canada
8 h-index
10 publications
447 citations
New York University
New York, United States
7 h-index
9 publications
757 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
7 publications
206 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
7 publications
1.4K citations
1–8 of 163
41 publications · 3.3K citations
27
h-index
JACM · 9 publications · 286 citations
9
h-index
7 publications · 916 citations
7
h-index
TPDS · 7 publications · 181 citations
7
h-index
Repository · 6 publications · 156 citations
6
h-index
1–5