( en | de | ru )

 

Disambiguation of "Zaks, Shmuel"

Author of the publication

copydeleteadd this publication to your clipboard
Fair Deriviations in Context-Free Grammars

, , , and . Inf. Control., 55 (1-3): 108-116 (October 1982)

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

The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors., , and . SIAM J. Comput., 16 (2): 231-236 (1987)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)More Patterns in Trees: Up and Down, Young and Old, Odd and Even., and . SIAM J. Discret. Math., 23 (1): 447-465 (2009)On the Intersection of Tolerance and Cocomparability Graphs, and . CoRR, (2012)Online Regenerator Placement., , , and . CoRR, (2013)Applied Tree Enumerations., and . CAAP, volume 112 of Lecture Notes in Computer Science, page 180-193. Springer, (1981)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)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)Making Distributed Spanning Tree Algorithms Fault-Resilient., , , and . STACS, volume 247 of Lecture Notes in Computer Science, page 432-444. Springer, (1987)