Hypercube Topology
Hypercube Topology is a network architecture in which processors are arranged at the vertices of an n-dimensional hypercube and connected along edges such that each node is directly linked to n other nodes, differing by exactly one bit in their binary address representation.
814
Publications
40.7K
Citations
1.3K
Authors
514
Institutions
Publications per year
2017–2026
72
Variants
N-cube Topology
Parents
814
Topological properties of hypercubes
Yousef Saad, Martin H. Schultz · IEEE Transactions on Computers · 1988 · 1.4K citations
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text
Implementing data cubes efficiently
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman · 1996 · 1.2K citations
1–5 of 814
1.3K
14
h-index
12
h-index
11
h-index
11
h-index
11
h-index
1–5 of 1.3K
514
University of Michigan
Ann Arbor, United States
20 h-index
38 publications
3.7K citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
14 h-index
33 publications
1.9K citations
Beijing Jiaotong University
Beijing, China
12 h-index
32 publications
1.1K citations

Soochow University
Suzhou, China
12 h-index
37 publications
1.5K citations

University of Minnesota
Minneapolis, United States
12 h-index
25 publications
1.3K citations
The Ohio State University
Columbus, United States
12 h-index
25 publications
938 citations
California Institute of Technology
Pasadena, United States
11 h-index
23 publications
1.8K citations
Michigan State University
East Lansing, United States
11 h-index
27 publications
1.3K citations
1–8 of 514
66 publications · 8K citations
39
h-index
TPDS · 62 publications · 3.9K citations
36
h-index
32 publications · 1.5K citations
21
h-index
29 publications · 1.1K citations
21
h-index
23 publications · 1K citations
20
h-index
1–5