dblp.uni-trier.dewww.uni-trier.de

Shmuel Zaks Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
106EEMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks: Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12
105EEMichele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks: On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162
104EEMichele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs in a general topology optical network. Discrete Applied Mathematics 157(12): 2701-2717 (2009)
103EEGiuseppe Prencipe, Shmuel Zaks: Preface. Theor. Comput. Sci. 410(14): 1305-1306 (2009)
2008
102EEViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77
101EEMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929
100EEViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233
99EEMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Selfishness, collusion and power of local search for the ADMs minimization problem. Computer Networks 52(9): 1721-1731 (2008)
98EEFanica Gavril, Ron Y. Pinter, Shmuel Zaks: Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6(2): 216-228 (2008)
97EEMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008)
96EEMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem in tree and star networks. J. Parallel Distrib. Comput. 68(7): 939-948 (2008)
2007
95 Giuseppe Prencipe, Shmuel Zaks: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings Springer 2007
94EEMordechai Shalom, Prudence W. H. Wong, Shmuel Zaks: Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC 2007: 435-449
93EEMichel Raynal, Sam Toueg, Shmuel Zaks: DISC at Its 20th Anniversary (Stockholm, 2006). DISC 2007: 501-503
92EEMordechai Shalom, Walter Unger, Shmuel Zaks: On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271
91EEViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123
90EEStefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411
89EEMordechai Shalom, Shmuel Zaks: A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans. Netw. 15(6): 1593-1602 (2007)
88EEMichele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distrib. Comput. 67(4): 448-455 (2007)
87EEMordechai Shalom, Shmuel Zaks: Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. Theor. Comput. Sci. 384(2-3): 250-262 (2007)
2006
86EEMichele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85
85EEMichele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473
84EEMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158
2005
83EEMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924
82EEMordechai Shalom, Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291
2004
81EEMordechai Shalom, Shmuel Zaks: A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262
2002
80 Tamar Eilam, Shlomo Moran, Shmuel Zaks: The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289(1): 85-104 (2002)
2001
79 Shmuel Zaks: Design Issues in ATM and Optical Networks. Computers and Artificial Intelligence 20(2): (2001)
2000
78EEShmuel Zaks: Duality in ATM Layout Problems. CIAC 2000: 44-58
77EETamar Eilam, Shlomo Moran, Shmuel Zaks: Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
76EEShmuel Zaks: On the Use of Duality and Geometry in Layouts for ATM Networks. MFCS 2000: 114-131
75EEYefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
1999
74EEJan K. Pachl, Shmuel Zaks: Computation in an algebra of test selection criteria CoRR cs.SE/9912018: (1999)
73EETamar Eilam, Shlomo Moran, Shmuel Zaks: Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
72EEKing-Shan Lui, Shmuel Zaks: Scheduling in Synchronous Networks and the Greedy Algorithm. Theor. Comput. Sci. 220(1): 157-183 (1999)
1998
71 Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines. Algorithmica 20(3): 294-308 (1998)
70EEOrnan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal layouts on a chain ATM network. Discrete Applied Mathematics 83(1-3): 157-178 (1998)
69EEOrnan Ori Gerstel, Israel Cidon, Shmuel Zaks: Efficient support for client/server applications over heterogeneous ATM network. IEEE/ACM Trans. Netw. 6(4): 432-446 (1998)
68 Tamar Eilam, Michele Flammini, Shmuel Zaks: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. Parallel Processing Letters 8(2): 207-220 (1998)
67EEMordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. 205(1-2): 99-114 (1998)
1997
66EETamar Eilam, Michele Flammini, Shmuel Zaks: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). ICALP 1997: 527-537
65EEYefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106
64 Marcelo Feighelstein, Shmuel Zaks: Duality in Chain ATM Virtual Path Layouts. SIROCCO 1997: 228-239
63 Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111
62 Shmuel Zaks: Path Layout in ATM Networks. SOFSEM 1997: 144-160
61EETamar Eilam, Shlomo Moran, Shmuel Zaks: A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51
60EEKing-Shan Lui, Shmuel Zaks: Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract). WDAG 1997: 66-80
59EEYefim Dinitz, Marcelo Feighelstein, Shmuel Zaks: On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. WG 1997: 171-183
58 Ornan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting. Algorithmica 18(3): 405-416 (1997)
1996
57 Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks: Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. INFOCOM 1996: 1294-1301
56 Derek Hing-leung Ngok, Shmuel Zaks: On the Power of Local Information in Scheduling in Synchronous Networks. SIROCCO 1996: 301-312
55EETamar Eilam, Shlomo Moran, Shmuel Zaks: A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205
54EEOrnan Ori Gerstel, Israel Cidon, Shmuel Zaks: Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches. Chicago J. Theor. Comput. Sci. 1996: (1996)
53EEOrnan Ori Gerstel, Israel Cidon, Shmuel Zaks: The layout of virtual paths in ATM networks. IEEE/ACM Trans. Netw. 4(6): 873-884 (1996)
1995
52 Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines (Extended Abstract). COCOON 1995: 520-529
51EEOrnan Ori Gerstel, Avishai Wool, Shmuel Zaks: Optimal Layouts on a Chain ATM Network (Extended Abstract). ESA 1995: 508-522
50EEOfer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theor. Comput. Sci. 145(1&2): 271-290 (1995)
1994
49EEMoshe Molcho, Shmuel Zaks: Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. ISAAC 1994: 101-109
48 Ornan Ori Gerstel, Shmuel Zaks: The Virtual Path Layout Problem in Fast Networks (Extended Abstract). PODC 1994: 235-243
47 Ornan Ori Gerstel, Shmuel Zaks: Path Layout in ATM Networks. SIROCCO 1994: 151-166
46EEIsrael Cidon, Ornan Ori Gerstel, Shmuel Zaks: A Scalable Approach to Routing in ATM Networks. WDAG 1994: 209-222
45EEMordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291
44EEGerard Tel, Ephraim Korach, Shmuel Zaks: Synchronizing ABD networks. IEEE/ACM Trans. Netw. 2(1): 66-69 (1994)
43 Dexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. Theor. Comput. Sci. 123(2): 377-388 (1994)
1993
42EEOrnan Ori Gerstel, Shmuel Zaks: The Bit Complexity of Distributed Sorting (Extended Abstract). ESA 1993: 181-191
41EEDexter Kozen, Shmuel Zaks: Optimal Bounds for the Change-Making Problem. ICALP 1993: 150-161
40EESara Bitan, Shmuel Zaks: Optimal Linear Broadcast Routing with Capacity Limitations. ISAAC 1993: 287-296
39 Yossi Malka, Shlomo Moran, Shmuel Zaks: A Lower Bound on the Period Length of a Distributed Scheduler. Algorithmica 10(5): 383-398 (1993)
38 Sara Bitan, Shmuel Zaks: Optimal Linear Broadcast. J. Algorithms 14(2): 288-315 (1993)
1992
37 Adrian Segall, Shmuel Zaks: Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings Springer 1992
36EEOrnan Ori Gerstel, Shmuel Zaks: A New Characterization of Tree Medians with Applications to Distributed Algorithms. WG 1992: 135-144
1990
35EESara Bitan, Shmuel Zaks: Optimal Linear Broadcast. SIGAL International Symposium on Algorithms 1990: 368-377
34EEOfer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990: 373-389
33EEOfer Biran, Shlomo Moran, Shmuel Zaks: Deciding 1-sovability of distributed task is NP-hard. WG 1990: 206-220
32EEAlon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Optimal Distributed t-Resilient Election in Complete Networks. IEEE Trans. Software Eng. 16(4): 415-420 (1990)
31 Ofer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990)
1989
30 Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989)
29EENachum Dershowitz, Shmuel Zaks: Patterns in trees. Discrete Applied Mathematics 25(3): 241-255 (1989)
28 Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks: Bit Complexity of Order Statistics on a Distributed Star Network. Inf. Process. Lett. 30(3): 127-132 (1989)
27 Ephraim Korach, Shlomo Moran, Shmuel Zaks: Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1): 125-132 (1989)
1988
26 Yossi Malka, Shlomo Moran, Shmuel Zaks: Analysis of a Distributed Scheduler for Communication Networks. AWOC 1988: 351-360
25EEEphraim Korach, Gerard Tel, Shmuel Zaks: Optimal Synchronization of ABD Networks. Concurrency 1988: 353-367
24EEOfer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. PODC 1988: 263-275
23 Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks: Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. Mathematical Systems Theory 21(2): 85-98 (1988)
1987
22EEJan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks: Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356
21EEReuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS 1987: 432-444
20EEChing-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks: Synchronizing Aysnchronous Bounded Delay Networks. WDAG 1987: 212-218
19 Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader Inf. Comput. 75(2): 162-177 (1987)
18 Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. SIAM J. Comput. 16(2): 231-236 (1987)
1986
17 Yishay Mansour, Shmuel Zaks: On the Bit Complexity of Distributed Computations in a Ring with a Leader. PODC 1986: 151-160
16EENachum Dershowitz, Shmuel Zaks: Ordered trees and non-crossing partitions. Discrete Mathematics 62(2): 215-218 (1986)
1985
15 Ephraim Korach, Shlomo Moran, Shmuel Zaks: The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. PODC 1985: 277-286
14 Shmuel Zaks: Optimal Distributed Algorithms for Sorting and Ranking. IEEE Trans. Computers 34(4): 376-379 (1985)
1984
13 Nachum Dershowitz, Shmuel Zaks: Patterns in Trees. CAAP 1984: 93-102
12 Ephraim Korach, Shlomo Moran, Shmuel Zaks: Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. PODC 1984: 199-207
11 Shmuel Zaks: A New Algorithm for Generation of Permutations. BIT 24(2): 196-204 (1984)
1983
10 Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks: On Sets of Boolean n -Projections Surjective. Acta Inf. 20: 103-111 (1983)
1982
9EEYossi Shiloach, Uzi Vishkin, Shmuel Zaks: Golden ratios in a pairs covering problem. Discrete Mathematics 41(1): 57-65 (1982)
8 Shmuel Zaks: Generation and Ranking of k-ary Trees. Inf. Process. Lett. 14(1): 44-48 (1982)
7 Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks: Fair Deriviations in Context-Free Grammars Information and Control 55(1-3): 108-116 (1982)
6 Yehoshua Perl, Shmuel Zaks: On the Complexity of Edge Labelings for Trees. Theor. Comput. Sci. 19: 1-16 (1982)
1981
5EENachum Dershowitz, Shmuel Zaks: Applied Tree Enumerations. CAAP 1981: 180-193
4EEYehoshua Perl, Shmuel Zaks: Deficient generalized Fibonacci maximum path graphs. Discrete Mathematics 34(2): 153-164 (1981)
1980
3EENachum Dershowitz, Shmuel Zaks: Enumerations of ordered trees. Discrete Mathematics 31(1): 9-28 (1980)
2 Shmuel Zaks: Lexicographic Generation of Ordered Trees. Theor. Comput. Sci. 10: 63-82 (1980)
1979
1 Shmuel Zaks, D. Richards: Generating Trees and Other Combinatorial Objects Lexicographically. SIAM J. Comput. 8(1): 73-81 (1979)

Coauthor Index

1Hagit Attiya (Chagit Attiya) [30]
2Reuven Bar-Yehuda [21]
3Ofer Biran [24] [31] [33] [34] [50]
4Sara Bitan [35] [38] [40]
5Ashok K. Chandra [10]
6Siu-Wing Cheng [52] [71]
7Viacheslav Chernoy [91] [100] [102]
8Ching-Tsun Chou [20]
9Israel Cidon [20] [46] [53] [54] [57] [69]
10Nachum Dershowitz [3] [5] [13] [16] [29]
11Yefim Dinitz [59] [65] [75]
12Tamar Eilam [55] [61] [63] [65] [66] [68] [73] [75] [77] [80]
13Paul Erdös [23]
14Marcelo Feighelstein [59] [64]
15Michele Flammini [66] [68] [83] [84] [85] [86] [88] [90] [96] [97] [99] [101] [104] [105] [106]
16Nissim Francez [7]
17Fanica Gavril [98]
18Ornan Ori Gerstel [28] [36] [42] [46] [47] [48] [51] [53] [54] [57] [58] [69] [70]
19Stefania Di Giannantonio [90]
20Mordecai J. Golin [45] [67]
21Inder S. Gopal [20]
22Alon Itai [32]
23Michael Kaminski [52] [71]
24Ephraim Korach [12] [15] [18] [25] [27] [44]
25Israel Koren [23]
26Lawrence T. Kou [10]
27Dexter Kozen [41] [43]
28Shay Kutten [21] [32]
29Jan van Leeuwen [22] [30]
30King-Shan Lui [60] [72]
31Yossi Malka [26] [39]
32Yishay Mansour [17] [19] [28]
33Alberto Marchetti-Spaccamela [105]
34George Markowsky [10]
35Moshe Molcho [49]
36Gianpiero Monaco [84] [90] [96] [99] [101] [105] [106]
37Shlomo Moran [7] [12] [15] [18] [23] [24] [26] [27] [31] [33] [34] [39] [50] [55] [61] [63] [65] [73] [75] [77] [80]
38Luca Moscardelli [83] [84] [90] [96] [97] [99] [101] [105] [106]
39Derek Hing-leung Ngok [56]
40Jan K. Pachl [74]
41Yehoshua Perl [4] [6]
42Ron Y. Pinter [98]
43Sara Porat [7]
44Giuseppe Prencipe [95] [103]
45Michel Raynal [93]
46D. Richards [1]
47Nicola Santoro [22] [30]
48Adrian Segall [37]
49Hadas Shachnai [106]
50Mordechai Shalom [81] [82] [83] [84] [85] [86] [87] [88] [89] [90] [91] [92] [94] [96] [97] [99] [100] [101] [102] [104] [106]
51Yossi Shiloach [9]
52Gabriel M. Silberman [23]
53Tami Tamir [106]
54Gerard Tel [25] [44]
55Sam Toueg [93]
56Walter Unger [92]
57Jorge Urrutia [22]
58Uzi Vishkin [9]
59Yaron Wolfsthal (Yaron Wolfstahl) [21] [32]
60Prudence W. H. Wong [94]
61Avishai Wool [51] [70]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)