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
56
Nissim Francez · ACM Transactions on Programming Languages and Systems · 1980 · 240 citations
Introduction to distributed algorithms
Choice Reviews Online · 1995 · 174 citations
Mesh-Connected Computers with Broadcasting
Stout · IEEE Transactions on Computers · 1983 · 138 citations
1–5 of 56
124
Institut de Recherche en Informatique et Systèmes Aléatoires, France
3 publications · 71 citations
3
h-index
3
h-index
University of Southern California, United States
3 publications · 96 citations
3
h-index
2
h-index
2
h-index
1–5 of 124
72
University of Southern California
Los Angeles, United States
3 h-index
7 publications
218 citations

University of Bologna
Bologna, Italy
3 h-index
8 publications
229 citations
Northeastern University
Boston, United States
2 h-index
2 publications
46 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
77 citations

Chongqing University
Chongqing, China
2 h-index
7 publications
150 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
3 publications
145 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
126 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
3 publications
268 citations
1–8 of 72
6 publications · 367 citations
6
h-index
2 publications · 30 citations
2
h-index
Conference · 2 publications · 37 citations
2
h-index
Conference · 2 publications · 41 citations
2
h-index
TPDS · 2 publications · 46 citations
2
h-index
1–5