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
Parents
302
A Parallel Mixture of SVMs for Very Large Scale Problems
Ronan Collobert, Samy Bengio, Yoshua Bengio · Neural Computation · 2002 · 368 citations · Full text
Running time and program size for self-assembled squares
Leonard M. Adleman, Qi Cheng, Ashish Goel et al. · 2001 · 239 citations
1–5 of 302
647
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 647
314
New York University
New York, United States
9 h-index
10 publications
374 citations
The University of Texas at Austin
Austin, United States
8 h-index
14 publications
506 citations
Courant Institute of Mathematical Sciences
New York, United States
6 h-index
6 publications
224 citations

University of Waterloo
Waterloo, Canada
6 h-index
12 publications
382 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
8 publications
322 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
7 publications
259 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
13 publications
371 citations
Duke University
Durham, United States
5 h-index
7 publications
363 citations
1–8 of 314
17 publications · 863 citations
13
h-index
14 publications · 591 citations
13
h-index
TPDS · 11 publications · 413 citations
11
h-index
Repository · 8 publications · 249 citations
8
h-index
5 publications · 196 citations
5
h-index
1–5