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

Authors

24

  1. AI
    Atsushi Ishigame

    Osaka Prefecture University, Japan

    1 publications · 17 citations

    1

    h-index

  2. XL
    Xiaopei Liu

    ShanghaiTech University, China

    1 publications · 26 citations

    1

    h-index

  3. AA
    Ariful Azad

    Lawrence Berkeley National Laboratory, United States

    1 publications · 34 citations

    1

    h-index

  4. MS
    Márió Szegedy

    Rutgers, The State University of New Jersey, United States

    1 publications · 12 citations

    1

    h-index

  5. JR
    John R. Gilbert

    Center for Human Genetics, United States

    1 publications · 34 citations

    1

    h-index

1–5 of 24

Venues

  1. Cryptography

    1 publications · 17 citations

    1

    h-index

  2. Journal of Computer and System Sciences

    1 publications · 12 citations

    1

    h-index

  3. 1

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 34 citations

    1

    h-index

  5. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 26 citations

    1

    h-index

1–5