( en | de | ru )

 

Disambiguation of "Zaks, Shmuel"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding 1-sovability of distributed task is NP-hard.

, , and . WG, volume 484 of Lecture Notes in Computer Science, page 206-220. 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.

Michael Zaks

Ascher Ben-Shmuel

 

Other publications of authors with the same name

Duality in Chain ATM Virtual Path Layouts., and . SIROCCO, page 228-239. Carleton Scientific, (1997)Optimizing bandwidth allocation in elastic optical networks with application to scheduling., , and . J. Discrete Algorithms, (2017)On the Intersection of Tolerance and Cocomparability Graphs, and . CoRR, (2012)Online Regenerator Placement., , , and . CoRR, (2013)On the Bit Complexity of Distributed Computations in a Ring with a Leader., and . PODC, page 151-160. ACM, (1986)A New Characterization of Tree Medians with Applications to Distributed Algorithms., and . WG, volume 657 of Lecture Notes in Computer Science, page 135-144. Springer, (1992)Applied Tree Enumerations., and . CAAP, volume 112 of Lecture Notes in Computer Science, page 180-193. Springer, (1981)Making Distributed Spanning Tree Algorithms Fault-Resilient., , , and . STACS, volume 247 of Lecture Notes in Computer Science, page 432-444. Springer, (1987)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)The Bit Complexity of Distributed Sorting (Extended Abstract)., and . ESA, volume 726 of Lecture Notes in Computer Science, page 181-191. Springer, (1993)