Work-depth Analysis
Work-Depth Analysis is a theoretical framework in parallel computing that characterizes the performance of parallel algorithms by distinguishing the total computational effort (work) from the length of the critical path (depth), thereby enabling the analysis of both time complexity and parallelizability.
14
Publications
440
Citations
42
Authors
15
Institutions
Publications per year
2017–2026
8
Parents
14
A provable time and space efficient implementation of NESL
Guy E. Blelloch, John Greiner · 1996 · 141 citations
1–5 of 14
42
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 42
15
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
350 citations
Stanford University
Stanford, United States
2 h-index
5 publications
88 citations
ETH Zurich
Zurich, Switzerland
2 h-index
4 publications
104 citations
Arizona State University
Tempe, United States
1 h-index
7 publications
91 citations
Kennesaw State University
Kennesaw, United States
1 h-index
1 publications
22 citations
Nanyang Technological University
Singapore, Singapore
1 h-index
4 publications
84 citations
Mayo Clinic in Florida
Jacksonville, United States
1 h-index
11 publications
143 citations

University of Edinburgh
Edinburgh, United Kingdom
1 h-index
1 publications
13 citations
1–8 of 15
Repository · 2 publications · 27 citations
2
h-index
1 publications · 34 citations
1
h-index
1 publications · 28 citations
1
h-index
IJMR · 1 publications · 25 citations
1
h-index
Repository · 1 publications · 13 citations
1
h-index
1–5