Parallel Divide-and-conquer Algorithms
Parallel Divide-And-Conquer Algorithms is a computational strategy that belongs to the class of divide-and-conquer algorithms and is distinguished by its simultaneous execution of recursive subproblems across multiple processing units to exploit concurrency in problem decomposition and solution composition.
178
Publications
8.5K
Citations
434
Authors
201
Institutions
Publications per year
2017–2026
28
Variants
Parallel Divide And Conquer Algorithms
Parents
178
The Parallel Evaluation of General Arithmetic Expressions
Richard P. Brent · Journal of the ACM · 1974 · 818 citations · Full text
1–5 of 178
434
4
h-index
4
h-index
Massachusetts Institute of Technology, United States
4 publications · 114 citations
4
h-index
4
h-index
4
h-index
1–5 of 434
201
University of California, Berkeley
Berkeley, United States
7 h-index
12 publications
668 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
11 publications
497 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
5 h-index
17 publications
477 citations
Stony Brook University
Stony Brook, United States
5 h-index
14 publications
422 citations

University of Passau
Passau, Germany
5 h-index
9 publications
212 citations
Purdue University West Lafayette
West Lafayette, United States
4 h-index
5 publications
401 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
5 publications
265 citations

University of Toronto
Toronto, Canada
4 h-index
7 publications
750 citations
1–8 of 201
TPDS · 5 publications · 186 citations
5
h-index
5 publications · 306 citations
5
h-index
5 publications · 120 citations
5
h-index
4 publications · 178 citations
4
h-index
4 publications · 90 citations
4
h-index
1–5