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

Authors

640

  1. PB
    P. Banerjee

    University of Illinois Urbana-Champaign, United States

    9 publications · 247 citations

    9

    h-index

  2. SS
    Sartaj Sahni

    University of Florida, United States

    8 publications · 343 citations

    8

    h-index

  3. LM
    Lionel M. Ni

    Hong Kong University of Science and Technology, Hong Kong SAR China

    8 publications · 368 citations

    8

    h-index

  4. GF
    Geoffrey Fox

    Indiana University Bloomington, United States

    7 publications · 179 citations

    7

    h-index

  5. CH
    Ching‐Tien Ho

    IBM Research - Almaden, United States

    6 publications · 203 citations

    6

    h-index

1–5 of 640

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 27 publications · 1.4K citations

    20

    h-index

  2. IEEE Transactions on Computers

    26 publications · 2.1K citations

    19

    h-index

  3. Journal of Parallel and Distributed Computing

    25 publications · 976 citations

    16

    h-index

  4. Parallel Computing

    15 publications · 493 citations

    12

    h-index

  5. Proceedings of the International Conference on Parallel Processing

    Conference · 12 publications · 368 citations

    11

    h-index

1–5