Hypercube Network Communication Complexity is a theoretical metric in parallel computing that quantifies the minimum number of communication steps required to perform information exchange across processors interconnected in a hypercube topology, distinguished by its reliance on the logarithmic diameter and recursive structure of the hypercube graph.
46
Publications
1.7K
Citations
84
Authors
63
Institutions
Publications per year
2017–2026
2
Parents
Publications
46
An Optimal Synchronizer for the Hypercube
David Peleg, Jeffrey D. Ullman · SIAM Journal on Computing · 1989 · 347 citations
An optimal synchronizer for the hypercube
David Peleg, Jeffrey D. Ullman · 1987 · 101 citations
1–5 of 46
Authors
84
- SD
3
h-index
- DP
3
h-index
- PR
2
h-index
- MA
2
h-index
- CK
2
h-index
1–5 of 84
Institutions
63
University of Rochester
Rochester, United States
2 h-index
2 publications
129 citations
Weizmann Institute of Science
Rehovot, Israel
2 h-index
2 publications
357 citations
University of Michigan
Ann Arbor, United States
2 h-index
3 publications
187 citations
Harvard University
Cambridge, United States
2 h-index
4 publications
258 citations
IBM Research - Almaden
San Jose, United States
2 h-index
2 publications
43 citations
Carleton University
Ottawa, Canada
2 h-index
2 publications
60 citations
The Ohio State University
Columbus, United States
2 h-index
4 publications
66 citations
Brock University
Saint Catharines, Canada
1 h-index
1 publications
19 citations
1–8 of 63
Venues
- Information Processing Letters
8 publications · 166 citations
8
h-index
- Discrete Mathematics
5 publications · 121 citations
5
h-index
- Journal of Parallel and Distributed Computing
4 publications · 158 citations
4
h-index
- The Journal of Supercomputing
2 publications · 42 citations
2
h-index
- SIAM Journal on Computing
2 publications · 426 citations
2
h-index
1–5