Shmuel Zaks

185 papers A* 11A 15B 31C 5Misc 2Journal 95Unranked 23
YearRankTypeTitle / Venue / Authors
2022 J jnl
Approximation algorithms for maximum weight k-coverings of graphs by packings.
Discret. Math. Algorithms Appl.
Fanica Gavril, Mordechai Shalom, Shmuel Zaks
2021 B conf
Hierarchical b-Matching.
SOFSEM
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2021 A* conf
Multicast Communications with Varying Bandwidth Constraints.
INFOCOM
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2021 J jnl
On the Online Coalition Structure Generation Problem.
J. Artif. Intell. Res.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2021 J jnl
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.
Algorithms
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2020 J jnl
Profit Maximization in Flex-Grid All-Optical Networks.
Theory Comput. Syst.
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2019 J jnl
Complexity and online algorithms for minimum skyline coloring of intervals.
Theor. Comput. Sci.
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2019 J jnl
Hierarchical b-Matching.
CoRR
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2019 J jnl
Maximizing Communication Throughput in Tree Networks.
CoRR
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2018 J jnl
Flexible bandwidth assignment with application to optical networks.
J. Sched.
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2018 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Discret. Math. Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2018 A conf
Online Coalition Structure Generation in Graph Games.
AAMAS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2017 — conf
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals.
COCOA (2)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017 J jnl
Energy-optimal collaborative file distribution in wired networks.
Peer-to-Peer Netw. Appl.
Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas Rumín, Arturo Azcorra, Shmuel Zaks, Alberto García-Martínez
2017 J jnl
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
Discret. Math. Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2017 J jnl
Online Regenerator Placement.
Theory Comput. Syst.
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017 J jnl
Optimizing bandwidth allocation in elastic optical networks with application to scheduling.
J. Discrete Algorithms
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2016 J jnl
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci.
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2016 J jnl
Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks.
IEEE Trans. Wirel. Commun.
Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone
2016 J jnl
Graphs of edge-intersecting and non-splitting paths.
Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2016 J jnl
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.
Discret. Appl. Math.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2016 J jnl
On the complexity of the regenerator location problem treewidth and other parameters.
Discret. Appl. Math.
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
2016 J jnl
On the intersection of tolerance and cocomparability graphs.
Discret. Appl. Math.
George B. Mertzios, Shmuel Zaks
2016 J jnl
On-line maximum matching in complete multi-partite graphs with an application to optical networks.
Discret. Appl. Math.
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2016 B conf
SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches.
AINA
Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez
2015 C conf
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.
CTW
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2015 J jnl
Designing Low Cost and Energy Efficient Access Network for the Developing World.
CoRR
Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez
2015 J jnl
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2015 B conf
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.
WG
Shmuel Zaks
2015 — conf
Online Lower Bounds and Offline Inapproximability in Optical Networks.
ADHOC-NOW
Shmuel Zaks
2015 J jnl
Optimizing busy time on parallel machines.
Theor. Comput. Sci.
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2014 — conf
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract).
MFCS (2)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2014 — conf
Graphs of edge-intersecting and non-splitting paths.
ICTCS
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2014 A* conf
Interference coordination strategies for content update dissemination in LTE-A.
INFOCOM
Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone
2014 J jnl
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2014 J jnl
On the complexity of constructing minimum changeover cost arborescences.
Theor. Comput. Sci.
Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks
2014 J jnl
Online optimization of busy time on parallel machines.
Theor. Comput. Sci.
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
2014 A conf
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling.
IPDPS
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
2013 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 B conf
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).
WG
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 J jnl
Online Regenerator Placement.
CoRR
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2013 B conf
Profit Maximization in Flex-Grid All-Optical Networks.
SIROCCO
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2012 B conf
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract).
WAOA
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
2012 J jnl
On the Intersection of Tolerance and Cocomparability Graphs
CoRR
George B. Mertzios, Shmuel Zaks
2012 C conf
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract).
TAMC
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
2012 B conf
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
LATIN
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2012 J jnl
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
Distributed Comput.
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2012 A conf
Optimizing Busy Time on Parallel Machines.
IPDPS
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2012 J jnl
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw.
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2011 A conf
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
DISC
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 B conf
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
OPODIS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2011 J jnl
On the complexity of the regenerator placement problem in optical networks.
IEEE/ACM Trans. Netw.
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
2011 B conf
Online Regenerator Placement.
OPODIS
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2011 J jnl
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
CoRR
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 J jnl
Optimizing regenerator cost in traffic grooming.
Theor. Comput. Sci.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2011 J jnl
The Recognition of Tolerance and Bounded Tolerance Graphs.
SIAM J. Comput.
George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010 J jnl
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2010 — conf
On the Intersection of Tolerance and Cocomparability Graphs.
ISAAC (1)
George B. Mertzios, Shmuel Zaks
2010 J jnl
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms.
Distributed Comput.
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2010 A conf
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
DISC
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2010 J jnl
Optimal on-line colorings for minimizing the number of ADMs in optical networks.
J. Discrete Algorithms
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2010 B conf
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).
OPODIS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2010 — conf
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests.
ICALP (2)
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010 J jnl
The Recognition of Tolerance and Bounded Tolerance Graphs
CoRR
George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010 A conf
The Recognition of Tolerance and Bounded Tolerance Graphs.
STACS
George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010 B conf
Traffic Grooming in Star Networks via Matching Techniques.
SIROCCO
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010 — ch.
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Graphs and Algorithms in Communication Networks
Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2009 B conf
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
WG
George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009 J jnl
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
SIAM J. Discret. Math.
George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009 A conf
Minimizing total busy time in parallel scheduling with application to optical networks.
IPDPS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2009 J jnl
More Patterns in Trees: Up and Down, Young and Old, Odd and Even.
SIAM J. Discret. Math.
Nachum Dershowitz, Shmuel Zaks
2009 J jnl
On minimizing the number of ADMs in a general topology optical network.
Discret. Appl. Math.
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2009 B conf
On the complexity of the regenerator placement problem in optical networks.
SPAA
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
2009 B conf
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
SIROCCO
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2009 J jnl
Preface.
Theor. Comput. Sci.
Giuseppe Prencipe, Shmuel Zaks
2008 A conf
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.
DISC
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2008 — conf
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Euro-Par
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distributed Comput.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Approximating the traffic grooming problem.
J. Discrete Algorithms
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Intersection representations of matrices by subtrees and unicycles on graphs.
J. Discrete Algorithms
Fanica Gavril, Ron Y. Pinter, Shmuel Zaks
2008 B conf
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion.
SIROCCO
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Selfishness, collusion and power of local search for the ADMs minimization problem.
Comput. Networks
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2007 J jnl
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings.
IEEE/ACM Trans. Netw.
Mordechai Shalom, Shmuel Zaks
2007 A conf
DISC at Its 20th Anniversary (Stockholm, 2006).
DISC
Michel Raynal, Sam Toueg, Shmuel Zaks
2007 J jnl
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem.
Theor. Comput. Sci.
Mordechai Shalom, Shmuel Zaks
2007 J jnl
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing.
J. Parallel Distributed Comput.
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2007 Misc conf
On the Complexity of the Traffic Grooming Problem in Optical Networks.
FUN
Mordechai Shalom, Walter Unger, Shmuel Zaks
2007 C conf
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.
SSS
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2007 A conf
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks.
DISC
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2007 — conf
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
WINE
Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2007 B ed.
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings
SIROCCO
Giuseppe Prencipe, Shmuel Zaks
2006 B conf
Approximating the Traffic Grooming Problem in Tree and Star Networks.
WG
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2006 — conf
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
CAAN
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2006 A conf
On Minimizing the Number of ADMs in a General Topology Optical Network.
DISC
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2005 B conf
Approximating the Traffic Grooming Problem.
ISAAC
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2005 B conf
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.
SIROCCO
Mordechai Shalom, Shmuel Zaks
2004 C conf
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.
BROADNETS
Mordechai Shalom, Shmuel Zaks
2002 J jnl
Lightpath arrangement in survivable rings to minimize the switching cost.
IEEE J. Sel. Areas Commun.
Tamar Eilam, Shlomo Moran, Shmuel Zaks
2002 J jnl
The complexity of the characterization of networks supporting shortest-path interval routing.
Theor. Comput. Sci.
Tamar Eilam, Shlomo Moran, Shmuel Zaks
2001 J jnl
Design Issues in ATM and Optical Networks.
Comput. Artif. Intell.
Shmuel Zaks
2000 A conf
Approximation Algorithms for Survivable Optical Networks.
DISC
Tamar Eilam, Shlomo Moran, Shmuel Zaks
2000 C conf
Duality in ATM Layout Problems.
CIAC
Shmuel Zaks
2000 B conf
On the Use of Duality and Geometry in Layouts for ATM Networks.
MFCS
Shmuel Zaks
2000 J jnl
On the totalk-diameter of connection networks.
Theor. Comput. Sci.
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
1999 J jnl
Computation in an algebra of test selection criteria
CoRR
Jan K. Pachl, Shmuel Zaks
1999 J jnl
Lower bounds for linear interval routing.
Networks
Tamar Eilam, Shlomo Moran, Shmuel Zaks
1999 J jnl
Scheduling in Synchronous Networks and the Greedy Algorithm.
Theor. Comput. Sci.
King-Shan Lui, Shmuel Zaks
1998 J jnl
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load.
Parallel Process. Lett.
Tamar Eilam, Michele Flammini, Shmuel Zaks
1998 J jnl
Efficient support for client/server applications over heterogeneous ATM network.
IEEE/ACM Trans. Netw.
Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
1998 J jnl
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues.
Theor. Comput. Sci.
Mordecai J. Golin, Shmuel Zaks
1998 J jnl
Minimum Dominating Sets of Intervals on Lines.
Algorithmica
Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
1998 J jnl
Optimal layouts on a chain ATM network.
Discret. Appl. Math.
Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks
1997 A* conf
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract).
ICALP
Tamar Eilam, Michele Flammini, Shmuel Zaks
1997 — conf
A Simple DFS-Based Algorithm for Linear Interval Routing.
WDAG
Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997 B conf
Duality in Chain ATM Virtual Path Layouts.
SIROCCO
Marcelo Feighelstein, Shmuel Zaks
1997 B conf
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l
WG
Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
1997 — conf
On the total
ISTCS
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
1997 B conf
Path Layout in ATM Networks.
SOFSEM
Shmuel Zaks
1997 — conf
Path layout in ATM networks-A survey.
Networks in Distributed Computing
Shmuel Zaks
1997 — conf
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract).
WDAG
King-Shan Lui, Shmuel Zaks
1997 J jnl
The Bit Complexity of Distributed Sorting.
Algorithmica
Ornan Ori Gerstel, Shmuel Zaks
1997 B conf
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing.
SIROCCO
Tamar Eilam, Shlomo Moran, Shmuel Zaks
1996 — conf
A Lower Bound for Linear Interval Routing.
WDAG
Tamar Eilam, Shlomo Moran, Shmuel Zaks
1996 A* conf
Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks.
INFOCOM
Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
1996 B conf
On the Power of Local Information in Scheduling in Synchronous Networks.
SIROCCO
Derek Hing-leung Ngok, Shmuel Zaks
1996 J jnl
Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches.
Chic. J. Theor. Comput. Sci.
Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
1996 J jnl
The layout of virtual paths in ATM networks.
IEEE/ACM Trans. Netw.
Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks
1995 Misc conf
Minimum Dominating Sets of Intervals on Lines (Extended Abstract).
COCOON
Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
1995 A conf
Optimal Layouts on a Chain ATM Network (Extended Abstract).
ESA
Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks
1995 J jnl
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
Theor. Comput. Sci.
Ofer Biran, Shlomo Moran, Shmuel Zaks
1994 — conf
A Scalable Approach to Routing in ATM Networks.
WDAG
Israel Cidon, Ornan Ori Gerstel, Shmuel Zaks
1994 J jnl
A new characterization of tree medians with applications to distributed sorting.
Networks
Ornan Ori Gerstel, Shmuel Zaks
1994 B conf
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues.
WG
Mordecai J. Golin, Shmuel Zaks
1994 — conf
On-the-fly replay: a practical paradigm and its implementation for distributed debugging.
SPDP
Ornan Ori Gerstel, Shmuel Zaks, Michel Hurfin, Noël Plouzeau, Michel Raynal
1994 J jnl
Optimal Bounds for the Change-Making Problem.
Theor. Comput. Sci.
Dexter Kozen, Shmuel Zaks
1994 B conf
Path Layout in ATM Networks.
SIROCCO
Ornan Ori Gerstel, Shmuel Zaks
1994 B conf
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring.
ISAAC
Moshe Molcho, Shmuel Zaks
1994 J jnl
Synchronizing ABD networks.
IEEE/ACM Trans. Netw.
Gerard Tel, Ephraim Korach, Shmuel Zaks
1994 A* conf
The Virtual Path Layout Problem in Fast Networks (Extended Abstract).
PODC
Ornan Ori Gerstel, Shmuel Zaks
1993 J jnl
A Lower Bound on the Period Length of a Distributed Scheduler.
Algorithmica
Yossi Malka, Shlomo Moran, Shmuel Zaks
1993 A* conf
Optimal Bounds for the Change-Making Problem.
ICALP
Dexter Kozen, Shmuel Zaks
1993 B conf
Optimal Linear Broadcast Routing with Capacity Limitations.
ISAAC
Sara Bitan, Shmuel Zaks
1993 J jnl
Optimal Linear Broadcast.
J. Algorithms
Sara Bitan, Shmuel Zaks
1993 A conf
The Bit Complexity of Distributed Sorting (Extended Abstract).
ESA
Ornan Ori Gerstel, Shmuel Zaks
1992 B conf
A New Characterization of Tree Medians with Applications to Distributed Algorithms.
WG
Ornan Ori Gerstel, Shmuel Zaks
1992 — ed.
Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings
WDAG
Adrian Segall, Shmuel Zaks
1990 J jnl
A Combinatorial Characterization of the Distributed 1-Solvable Tasks.
J. Algorithms
Ofer Biran, Shlomo Moran, Shmuel Zaks
1990 B conf
Deciding 1-sovability of distributed task is NP-hard.
WG
Ofer Biran, Shlomo Moran, Shmuel Zaks
1990 J jnl
Optimal Distributed t-Resilient Election in Complete Networks.
IEEE Trans. Software Eng.
Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
1990 — conf
Optimal Linear Broadcast.
SIGAL International Symposium on Algorithms
Sara Bitan, Shmuel Zaks
1990 J jnl
Synchronizing asynchronous bounded delay networks.
IEEE Trans. Commun.
Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks
1990 J jnl
The Cycle Lemma and Some Applications.
Eur. J. Comb.
Nachum Dershowitz, Shmuel Zaks
1990 — conf
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
WDAG
Ofer Biran, Shlomo Moran, Shmuel Zaks
1989 J jnl
Bit Complexity of Order Statistics on a Distributed Star Network.
Inf. Process. Lett.
Ornan Ori Gerstel, Yishay Mansour, Shmuel Zaks
1989 J jnl
Efficient Elections in Chordal Ring Networks.
Algorithmica
Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks
1989 J jnl
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Theor. Comput. Sci.
Ephraim Korach, Shlomo Moran, Shmuel Zaks
1989 J jnl
Patterns in trees.
Discret. Appl. Math.
Nachum Dershowitz, Shmuel Zaks
1988 A* conf
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor.
PODC
Ofer Biran, Shlomo Moran, Shmuel Zaks
1988 — conf
Analysis of a Distributed Scheduler for Communication Networks.
AWOC
Yossi Malka, Shlomo Moran, Shmuel Zaks
1988 J jnl
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays.
Math. Syst. Theory
Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks
1988 — conf
Optimal Synchronization of ABD Networks.
Concurrency
Ephraim Korach, Gerard Tel, Shmuel Zaks
1987 A* conf
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP
Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks
1987 A conf
Making Distributed Spanning Tree Algorithms Fault-Resilient.
STACS
Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
1987 J jnl
On the Bit Complexity of Distributed Computations in a Ring with a Leader
Inf. Comput.
Yishay Mansour, Shmuel Zaks
1987 — conf
Synchronizing Aysnchronous Bounded Delay Networks.
WDAG
Ching-Tsun Chou, Israel Cidon, Inder S. Gopal, Shmuel Zaks
1987 J jnl
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors.
SIAM J. Comput.
Ephraim Korach, Shlomo Moran, Shmuel Zaks
1986 A* conf
On the Bit Complexity of Distributed Computations in a Ring with a Leader.
PODC
Yishay Mansour, Shmuel Zaks
1986 J jnl
Ordered trees and non-crossing partitions.
Discret. Math.
Nachum Dershowitz, Shmuel Zaks
1985 J jnl
Optimal Distributed Algorithms for Sorting and Ranking.
IEEE Trans. Computers
Shmuel Zaks
1985 A* conf
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors.
PODC
Ephraim Korach, Shlomo Moran, Shmuel Zaks
1984 J jnl
A New Algorithm for Generation of Permutations.
BIT
Shmuel Zaks
1984 — conf
Patterns in Trees.
CAAP
Nachum Dershowitz, Shmuel Zaks
1984 A* conf
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors.
PODC
Ephraim Korach, Shlomo Moran, Shmuel Zaks
1983 J jnl
On Sets of Boolean
Acta Informatica
Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks
1982 J jnl
Fair Deriviations in Context-Free Grammars
Inf. Control.
Sara Porat, Nissim Francez, Shlomo Moran, Shmuel Zaks
1982 J jnl
Generation and Ranking of k-ary Trees.
Inf. Process. Lett.
Shmuel Zaks
1982 J jnl
Golden ratios in a pairs covering problem.
Discret. Math.
Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
1982 J jnl
On the Complexity of Edge Labelings for Trees.
Theor. Comput. Sci.
Yehoshua Perl, Shmuel Zaks
1981 — conf
Applied Tree Enumerations.
CAAP
Nachum Dershowitz, Shmuel Zaks
1981 J jnl
Deficient generalized Fibonacci maximum path graphs.
Discret. Math.
Yehoshua Perl, Shmuel Zaks
1980 J jnl
Enumerations of ordered trees.
Discret. Math.
Nachum Dershowitz, Shmuel Zaks
1980 J jnl
Lexicographic Generation of Ordered Trees.
Theor. Comput. Sci.
Shmuel Zaks
1979 J jnl
Generating Trees and Other Combinatorial Objects Lexicographically.
SIAM J. Comput.
Shmuel Zaks, D. Richards
1979 — —
Studies in Graph Algorithms: Generation and Labeling Problems
Shmuel Zaks