| 2007 |
|---|
| 94 | | Giuseppe Prencipe,
Shmuel Zaks:
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings
Springer 2007 |
| 93 | EE | Mordechai Shalom,
Prudence W. H. Wong,
Shmuel Zaks:
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks.
DISC 2007: 435-449 |
| 92 | EE | Michel Raynal,
Sam Toueg,
Shmuel Zaks:
DISC at Its 20th Anniversary (Stockholm, 2006).
DISC 2007: 501-503 |
| 91 | EE | Mordechai Shalom,
Walter Unger,
Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks.
FUN 2007: 262-271 |
| 90 | EE | Viacheslav Chernoy,
Mordechai Shalom,
Shmuel Zaks:
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.
SSS 2007: 114-123 |
| 89 | EE | Stefania 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 |
| 88 | EE | Mordechai 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) |
| 87 | EE | Michele 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) |
| 86 | EE | Mordechai 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 |
|---|
| 85 | EE | Michele Flammini,
Mordechai Shalom,
Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
CAAN 2006: 72-85 |
| 84 | EE | Michele Flammini,
Mordechai Shalom,
Shmuel Zaks:
On Minimizing the Number of ADMs in a General Topology Optical Network.
DISC 2006: 459-473 |
| 83 | EE | Michele Flammini,
Gianpiero Monaco,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks.
WG 2006: 147-158 |
| 2005 |
|---|
| 82 | EE | Michele Flammini,
Luca Moscardelli,
Mordechai Shalom,
Shmuel Zaks:
Approximating the Traffic Grooming Problem.
ISAAC 2005: 915-924 |
| 81 | EE | Mordechai Shalom,
Shmuel Zaks:
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.
SIROCCO 2005: 277-291 |
| 2004 |
|---|
| 80 | EE | Mordechai Shalom,
Shmuel Zaks:
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.
BROADNETS 2004: 254-262 |
| 2002 |
|---|
| 79 | | 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 |
|---|
| 78 | | Shmuel Zaks:
Design Issues in ATM and Optical Networks.
Computers and Artificial Intelligence 20(2): (2001) |
| 2000 |
|---|
| 77 | EE | Shmuel Zaks:
Duality in ATM Layout Problems.
CIAC 2000: 44-58 |
| 76 | EE | Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
Approximation Algorithms for Survivable Optical Networks.
DISC 2000: 104-118 |
| 75 | EE | Shmuel Zaks:
On the Use of Duality and Geometry in Layouts for ATM Networks.
MFCS 2000: 114-131 |
| 74 | EE | Yefim Dinitz,
Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
On the totalk-diameter of connection networks.
Theor. Comput. Sci. 247(1-2): 213-228 (2000) |
| 1999 |
|---|
| 73 | EE | Jan K. Pachl,
Shmuel Zaks:
Computation in an algebra of test selection criteria
CoRR cs.SE/9912018: (1999) |
| 72 | EE | Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
Lower bounds for linear interval routing.
Networks 34(1): 37-46 (1999) |
| 71 | EE | King-Shan Lui,
Shmuel Zaks:
Scheduling in Synchronous Networks and the Greedy Algorithm.
Theor. Comput. Sci. 220(1): 157-183 (1999) |
| 1998 |
|---|
| 70 | | Siu-Wing Cheng,
Michael Kaminski,
Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines.
Algorithmica 20(3): 294-308 (1998) |
| 69 | EE | Ornan Ori Gerstel,
Avishai Wool,
Shmuel Zaks:
Optimal layouts on a chain ATM network.
Discrete Applied Mathematics 83(1-3): 157-178 (1998) |
| 68 | EE | Ornan 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) |
| 67 | | 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) |
| 66 | EE | Mordecai 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 |
|---|
| 65 | | Tamar 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 |
| 64 | EE | Yefim Dinitz,
Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
On the totalk-diameter of connection networks.
ISTCS 1997: 96-106 |
| 63 | | Marcelo Feighelstein,
Shmuel Zaks:
Duality in Chain ATM Virtual Path Layouts.
SIROCCO 1997: 228-239 |
| 62 | | Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing.
SIROCCO 1997: 99-111 |
| 61 | | Shmuel Zaks:
Path Layout in ATM Networks.
SOFSEM 1997: 144-160 |
| 60 | | Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
A Simple DFS-Based Algorithm for Linear Interval Routing.
WDAG 1997: 37-51 |
| 59 | | King-Shan Lui,
Shmuel Zaks:
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract).
WDAG 1997: 66-80 |
| 58 | | Yefim Dinitz,
Marcelo Feighelstein,
Shmuel Zaks:
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres.
WG 1997: 171-183 |
| 57 | | Ornan Ori Gerstel,
Shmuel Zaks:
The Bit Complexity of Distributed Sorting.
Algorithmica 18(3): 405-416 (1997) |
| 1996 |
|---|
| 56 | | Ornan Ori Gerstel,
Israel Cidon,
Shmuel Zaks:
Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks.
INFOCOM 1996: 1294-1301 |
| 55 | | Derek Hing-leung Ngok,
Shmuel Zaks:
On the Power of Local Information in Scheduling in Synchronous Networks.
SIROCCO 1996: 301-312 |
| 54 | | Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
A Lower Bound for Linear Interval Routing.
WDAG 1996: 191-205 |
| 53 | EE | Ornan 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) |
| 52 | EE | Ornan Ori Gerstel,
Israel Cidon,
Shmuel Zaks:
The layout of virtual paths in ATM networks.
IEEE/ACM Trans. Netw. 4(6): 873-884 (1996) |
| 1995 |
|---|
| 51 | | Siu-Wing Cheng,
Michael Kaminski,
Shmuel Zaks:
Minimum Dominating Sets of Intervals on Lines (Extended Abstract).
COCOON 1995: 520-529 |
| 50 | | Ornan Ori Gerstel,
Avishai Wool,
Shmuel Zaks:
Optimal Layouts on a Chain ATM Network (Extended Abstract).
ESA 1995: 508-522 |
| 49 | EE | Ofer 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 |
|---|
| 48 | | Moshe Molcho,
Shmuel Zaks:
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring.
ISAAC 1994: 101-109 |
| 47 | | Ornan Ori Gerstel,
Shmuel Zaks:
The Virtual Path Layout Problem in Fast Networks (Extended Abstract).
PODC 1994: 235-243 |
| 46 | | Ornan Ori Gerstel,
Shmuel Zaks:
Path Layout in ATM Networks.
SIROCCO 1994: 151-166 |
| 45 | | Israel Cidon,
Ornan Ori Gerstel,
Shmuel Zaks:
A Scalable Approach to Routing in ATM Networks.
WDAG 1994: 209-222 |
| 44 | | Mordecai J. Golin,
Shmuel Zaks:
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues.
WG 1994: 282-291 |
| 43 | EE | Gerard Tel,
Ephraim Korach,
Shmuel Zaks:
Synchronizing ABD networks.
IEEE/ACM Trans. Netw. 2(1): 66-69 (1994) |
| 42 | | Dexter Kozen,
Shmuel Zaks:
Optimal Bounds for the Change-Making Problem.
Theor. Comput. Sci. 123(2): 377-388 (1994) |
| 1993 |
|---|
| 41 | | Ornan Ori Gerstel,
Shmuel Zaks:
The Bit Complexity of Distributed Sorting (Extended Abstract).
ESA 1993: 181-191 |
| 40 | | Dexter Kozen,
Shmuel Zaks:
Optimal Bounds for the Change-Making Problem.
ICALP 1993: 150-161 |
| 39 | | Sara Bitan,
Shmuel Zaks:
Optimal Linear Broadcast Routing with Capacity Limitations.
ISAAC 1993: 287-296 |
| 38 | | Yossi Malka,
Shlomo Moran,
Shmuel Zaks:
A Lower Bound on the Period Length of a Distributed Scheduler.
Algorithmica 10(5): 383-398 (1993) |
| 37 | | Sara Bitan,
Shmuel Zaks:
Optimal Linear Broadcast.
J. Algorithms 14(2): 288-315 (1993) |
| 1992 |
|---|
| 36 | | Adrian Segall,
Shmuel Zaks:
Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings
Springer 1992 |
| 35 | | Ornan Ori Gerstel,
Shmuel Zaks:
A New Characterization of Tree Medians with Applications to Distributed Algorithms.
WG 1992: 135-144 |
| 1990 |
|---|
| 34 | | Sara Bitan,
Shmuel Zaks:
Optimal Linear Broadcast.
SIGAL International Symposium on Algorithms 1990: 368-377 |
| 33 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
WDAG 1990: 373-389 |
| 32 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
Deciding 1-sovability of distributed task is NP-hard.
WG 1990: 206-220 |
| 31 | EE | Alon Itai,
Shay Kutten,
Yaron Wolfstahl,
Shmuel Zaks:
Optimal Distributed t-Resilient Election in Complete Networks.
IEEE Trans. Software Eng. 16(4): 415-420 (1990) |
| 30 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks.
J. Algorithms 11(3): 420-440 (1990) |
| 1989 |
|---|
| 29 | | Hagit Attiya,
Jan van Leeuwen,
Nicola Santoro,
Shmuel Zaks:
Efficient Elections in Chordal Ring Networks.
Algorithmica 4(3): 437-446 (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 |
| 25 | | Ephraim Korach,
Gerard Tel,
Shmuel Zaks:
Optimal Synchronization of ABD Networks.
Concurrency 1988: 353-367 |
| 24 | EE | Ofer 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 |
|---|
| 22 | | Jan van Leeuwen,
Nicola Santoro,
Jorge Urrutia,
Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP 1987: 347-356 |
| 21 | | Reuven Bar-Yehuda,
Shay Kutten,
Yaron Wolfstahl,
Shmuel Zaks:
Making Distributed Spanning Tree Algorithms Fault-Resilient.
STACS 1987: 432-444 |
| 20 | | Ching-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 |
| 16 | EE | Nachum 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 |
|---|
| 9 | EE | Yossi 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 |
|---|
| 5 | | Nachum Dershowitz,
Shmuel Zaks:
Applied Tree Enumerations.
CAAP 1981: 180-193 |
| 4 | EE | Yehoshua Perl,
Shmuel Zaks:
Deficient generalized Fibonacci maximum path graphs.
Discrete Mathematics 34(2): 153-164 (1981) |
| 1980 |
|---|
| 3 | EE | Nachum 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) |
