( en | de | ru )

 

Disambiguation of "Zaks, Shmuel"

Author of the publication

copydeleteadd this publication to your clipboard
On-the-fly replay: a practical paradigm and its implementation for distributed debugging.

, , , , and . SPDP, page 266-272. IEEE Computer Society, (1994)

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 Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . Algorithmica, 68 (3): 671-691 (2014)Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors., , and . Theor. Comput. Sci., 64 (1): 125-132 (1989)Labelled Trees and Pairs of Input-Output Permutations in Priority Queues., and . Theor. Comput. Sci., 205 (1-2): 99-114 (1998)Graphs of edge-intersecting and non-splitting paths., , , and . ICTCS, volume 1231 of CEUR Workshop Proceedings, page 45-58. CEUR-WS.org, (2014)On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming., , , , and . OPODIS, volume 7109 of Lecture Notes in Computer Science, page 96-111. Springer, (2011)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , and . IPDPS, page 1-12. IEEE, (2009)On the Bit Complexity of Distributed Computations in a Ring with a Leader, and . Inf. Comput., 75 (2): 162-177 (November 1987)Generating Trees and Other Combinatorial Objects Lexicographically., and . SIAM J. Comput., 8 (1): 73-81 (1979)Profit Maximization in Flex-Grid All-Optical Networks., , and . Theory Comput. Syst., 64 (2): 311-326 (2020)Lightpath arrangement in survivable rings to minimize the switching cost., , and . IEEE J. Sel. Areas Commun., 20 (1): 172-182 (2002)