Communication-efficient Data Structures
Communication-Efficient Data Structures is a class of data organization paradigms designed to minimize the amount of communication between computational entities during data access and manipulation, distinguished by their explicit optimization of communication cost—such as the number of bits or messages exchanged—relative to computational or storage overhead in distributed, parallel, or external-memory settings.
8
Publications
289
Citations
24
Authors
14
Institutions
Publications per year
2017–2026
4
Parents
8
Accurate, Efficient and Scalable Graph Embedding
Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava et al. · 2019 · 74 citations · Full text
1–5 of 8
24
1
h-index
1
h-index
1
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 12 citations
1
h-index
1
h-index
1–5 of 24
14
University of California, Santa Barbara
Santa Barbara, United States
1 h-index
1 publications
34 citations

DEVCOM Army Research Laboratory
Adelphi, United States
1 h-index
1 publications
74 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
39 citations
ShanghaiTech University
Shanghai, China
1 h-index
4 publications
104 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
12 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
12 citations
Indiana University Bloomington
Bloomington, United States
1 h-index
2 publications
68 citations
Institute of High Performance Computing
Singapore, Singapore
1 h-index
1 publications
17 citations
1–8 of 14
1 publications · 17 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 75 citations
1
h-index
TPDS · 1 publications · 34 citations
1
h-index
TVCG · 1 publications · 26 citations
1
h-index
1–5