( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.

, , and . WDAG, volume 486 of Lecture Notes in Computer Science, page 373-389. Springer, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Shlomo Kipnis

Diana Westfalia Morán Puente

Shlomo Peer

Shlomo Havlin

Shlomo Berger

 

Other publications of authors with the same name

Optimal implementations of UPGMA and other common clustering algorithms., and . Inf. Process. Lett., 104 (6): 205-210 (2007)Estimating Metrical Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case., and . IEEE Trans. Computers, 37 (9): 1156-1162 (1988)SALSA: the stochastic approach for link-structure analysis., and . ACM Trans. Inf. Syst., 19 (2): 131-160 (2001)Partial convex recolorings of trees and galled networks: Tight upper and lower bounds., , and . ACM Trans. Algorithms, 7 (4): 42:1-42:20 (2011)Applications of Ramsey's Theorem to Decision Tree Complexity, , and . J. ACM, 32 (4): 938-949 (October 1985)The Wakeup Problem (Extended Abstract), , , and . STOC, page 106-116. ACM, (1990)Gap Theorems for Distributed Computation., and . PODC, page 131-140. ACM, (1986)Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors., , and . PODC, page 199-207. ACM, (1984)The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors., , and . PODC, page 277-286. ACM, (1985)Analysis of a Distributed Scheduler for Communication Networks., , and . AWOC, volume 319 of Lecture Notes in Computer Science, page 351-360. Springer, (1988)