( en | de | ru )

 

Disambiguation of "Moran, Shlomo"

Author of the publication

copydeleteadd this publication to your clipboard
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings.

, and . PODC, page 282-292. ACM, (1986)

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

The Firing Squad Problem Revisited., and . STACS, volume 96 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simple and optimal randomized fault-tolerant rumor spreading., , , and . Distributed Comput., 29 (2): 89-104 (2016)On the Limitation of the Global Time Assumption in Distributed Systems (Extended Abstract)., , and . WDAG, volume 579 of Lecture Notes in Computer Science, page 1-8. Springer, (1991)A Simple DFS-Based Algorithm for Linear Interval Routing., , and . WDAG, volume 1320 of Lecture Notes in Computer Science, page 37-51. Springer, (1997)A Lower Bound for Linear Interval Routing., , and . WDAG, volume 1151 of Lecture Notes in Computer Science, page 191-205. Springer, (1996)Analysis of a Distributed Scheduler for Communication Networks., , and . AWOC, volume 319 of Lecture Notes in Computer Science, page 351-360. Springer, (1988)The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case., , and . FCT, volume 380 of Lecture Notes in Computer Science, page 58-67. Springer, (1989)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)Deciding 1-sovability of distributed task is NP-hard., , and . WG, volume 484 of Lecture Notes in Computer Science, page 206-220. Springer, (1990)