Distributed Sorting

Distributed Sorting is a distributed algorithm that organizes data elements across multiple interconnected processing nodes into a globally ordered sequence through coordinated local sorting and inter-node communication.

56

Publications

2.1K

Citations

124

Authors

72

Institutions

Publications per year

2017–2026

7

Authors

124

  1. MR
    Michel Raynal

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    3 publications · 71 citations

    3

    h-index

  2. SL
    Songze Li

    University of Southern California, United States

    3 publications · 96 citations

    3

    h-index

  3. MA
    Mohammad Ali Maddah-Ali

    University of Southern California, United States

    3 publications · 96 citations

    3

    h-index

  4. SU
    Susan Uren

    Northeastern University, United States

    2 publications · 46 citations

    2

    h-index

  5. SZ
    Shmuel Zaks

    Technion – Israel Institute of Technology, Israel

    2 publications · 65 citations

    2

    h-index

1–5 of 124

Venues

  1. IEEE Transactions on Computers

    6 publications · 367 citations

    6

    h-index

  2. Science of Computer Programming

    2 publications · 30 citations

    2

    h-index

  3. International Workshop on Distributed Algorithms

    Conference · 2 publications · 37 citations

    2

    h-index

  4. Very Large Data Bases

    Conference · 2 publications · 41 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 46 citations

    2

    h-index

1–5