( en | de | ru )

 

Disambiguation of "Zaks, Shmuel"

Author of the publication

copydeleteadd this publication to your clipboard
Interference coordination strategies for content update dissemination in LTE-A.

, , , , and . INFOCOM, page 1797-1805. IEEE, (2014)

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

On the intersection of tolerance and cocomparability graphs., and . Discret. Appl. Math., (2016)Duality in Chain ATM Virtual Path Layouts., and . SIROCCO, page 228-239. Carleton Scientific, (1997)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)Making Distributed Spanning Tree Algorithms Fault-Resilient., , , and . STACS, volume 247 of Lecture Notes in Computer Science, page 432-444. Springer, (1987)Applied Tree Enumerations., and . CAAP, volume 112 of Lecture Notes in Computer Science, page 180-193. Springer, (1981)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)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)Labelled Trees and Pairs of Input-Output Permutations in Priority Queues., and . WG, volume 903 of Lecture Notes in Computer Science, page 282-291. Springer, (1994)