Parallel Algorithms On Hypercubes
Parallel Algorithms On Hypercubes is a computational framework that enables the systematic design and analysis of parallel algorithms specifically optimized for execution on hypercube-structured interconnection networks, distinguished by its exploitation of the hypercube’s recursive, low-diameter topology to facilitate efficient communication and load balancing among processing nodes.
346
Publications
13.7K
Citations
640
Authors
255
Institutions
Publications per year
2017–2026
14
Parents
346
An Optimal Synchronizer for the Hypercube
David Peleg, Jeffrey D. Ullman · SIAM Journal on Computing · 1989 · 347 citations
H.P. Katseff · IEEE Transactions on Computers · 1988 · 269 citations
1–5 of 346
640
9
h-index
8
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
8 publications · 368 citations
8
h-index
7
h-index
6
h-index
1–5 of 640
255
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
20 publications
621 citations
The Ohio State University
Columbus, United States
13 h-index
37 publications
1.2K citations
California Institute of Technology
Pasadena, United States
11 h-index
22 publications
653 citations
Yale University
New Haven, United States
10 h-index
17 publications
2.5K citations

University of Minnesota
Minneapolis, United States
9 h-index
19 publications
1.1K citations
Michigan State University
East Lansing, United States
8 h-index
17 publications
909 citations
University of Michigan
Ann Arbor, United States
8 h-index
13 publications
508 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
14 publications
882 citations
1–8 of 255
TPDS · 27 publications · 1.4K citations
20
h-index
26 publications · 2.1K citations
19
h-index
25 publications · 976 citations
16
h-index
15 publications · 493 citations
12
h-index
Conference · 12 publications · 368 citations
11
h-index
1–5