@inproceedings{ec1c34688d32479ea4f95450cdd657b8,

title = "Sparser: A paradigm for running distributed algorithms",

abstract = "This paper introduces a transformer for improving the communication complexity of several classes of distributed algorithms. The transformer takes a distributed algorithm whose message complexity is O(f · m) and produces a new distributed algorithm for the same problem with O(f · n log n + m log n) message complexity, where n and m are the total number of nodes and links in the network, and f is an arbitrary function of n and m. Applying our paradigm to the standard all shortest paths algorithm [15, 16, 22] yields a new algorithm which solves the problem in O(n2log n) messages (The previous best that we know of is O(m · n) messages). When applied to the O(m · polylogn) breadth-first search algorithm of Awerbuch and Peleg [8] our paradigm yields an O(m+n · polylogn) messages algorithm.",

author = "Yehuda Afek and Moty Ricklin",

note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 6th International Workshop on Distributed Algorithms, WDAG 1992 ; Conference date: 02-11-1992 Through 04-11-1992",

year = "1992",

doi = "10.1007/3-540-56188-9_1",

language = "אנגלית",

isbn = "9783540561880",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--10",

editor = "Adrian Segall and Shmuel Zaks",

booktitle = "Distributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings",

}