@inproceedings{62308f3acb0e41829b7bb5fae2e32537,

title = "The round complexity of distributed sorting: Extended abstract",

abstract = "We consider the model of fully connected networks, where in each round each node can send an O(log n)-bit message to each other node (this is the CONGEST model with diameter 1). It is known that in this model, min-weight spanning trees can be found in O(log log n) rounds. In this paper we show that distributed sorting, where each node has at most n items, can be done in time O(log log n) as well. It is also shown that selection can be done in O(1) time. (Using a concurrent result by Lenzen and Wattenhofer, the complexity of sorting is further reduced to constant.) Our algorithms are randomized, and the stated complexity bounds hold with high probability.",

keywords = "communication complexity, congest model, distributed sorting, network algorithms",

author = "Boaz Patt-Shamir and Marat Teplitsky",

year = "2011",

doi = "10.1145/1993806.1993851",

language = "אנגלית",

isbn = "9781450307192",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "249--255",

booktitle = "PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing",

note = "null ; Conference date: 06-06-2011 Through 08-06-2011",

}