Shmuel Zaks
Orcid: 0000000156374923Affiliations:
 Technion, Haifa, Israel
According to our database^{1},
Shmuel Zaks
authored at least 150 papers
between 1979 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on id.loc.gov
On csauthors.net:
Bibliography
2022
Discret. Math. Algorithms Appl., 2022
2021
J. Artif. Intell. Res., 2021
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.
Algorithms, 2021
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021
Proceedings of the 40th IEEE Conference on Computer Communications, 2021
2020
Theory Comput. Syst., 2020
2019
Theor. Comput. Sci., 2019
CoRR, 2019
2018
J. Sched., 2018
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Representations of HolesPart II.
Discret. Math. Theor. Comput. Sci., 2018
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
PeertoPeer Netw. Appl., 2017
Theory Comput. Syst., 2017
Optimizing bandwidth allocation in elastic optical networks with application to scheduling.
J. Discrete Algorithms, 2017
Discret. Math. Theor. Comput. Sci., 2017
2016
IEEE Trans. Wirel. Commun., 2016
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
Online maximum matching in complete multipartite graphs with an application to optical networks.
Discret. Appl. Math., 2016
Discret. Appl. Math., 2016
On the complexity of the regenerator location problem treewidth and other parameters.
Discret. Appl. Math., 2016
Graphs of edgeintersecting nonsplitting paths in a tree: Representations of holes  Part I.
Discret. Appl. Math., 2016
SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches.
Proceedings of the 30th IEEE International Conference on Advanced Information Networking and Applications, 2016
2015
Theor. Comput. Sci., 2015
CoRR, 2015
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2015
Proceedings of the Adhoc, Mobile, and Wireless Networks  14th International Conference, 2015
2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica, 2014
Flexible Bandwidth Assignment with Application to Optical Networks  (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Optimizing Bandwidth Allocation in FlexGrid Optical Networks with Application to Scheduling.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014
2013
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Towards Hole RepresentationsPart I.
CoRR, 2013
Graphs of EdgeIntersecting Nonsplitting Paths in a Tree: Towards Hole Representations  (Extended Abstract).
Proceedings of the GraphTheoretic Concepts in Computer Science, 2013
2012
IEEE/ACM Trans. Netw., 2012
Opportunistic information dissemination in mobile adhoc networks: the profit of global synchrony.
Distributed Comput., 2012
On the Complexity of the Regenerator Location Problem  Treewidth and Other Parameters  (Extended Abstract).
Proceedings of the Approximation and Online Algorithms  10th International Workshop, 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Opportunistic Information Dissemination in Mobile AdHoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
2011
IEEE/ACM Trans. Netw., 2011
Theor. Comput. Sci., 2011
SIAM J. Comput., 2011
Brief Announcement: Opportunistic Information Dissemination in Mobile AdHoc Networks:  Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
Proceedings of the Distributed Computing  25th International Symposium, 2011
2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010
J. Discrete Algorithms, 2010
On the performance of Dijkstra's third selfstabilizing algorithm for mutual exclusion and related algorithms.
Distributed Comput., 2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the Principles of Distributed Systems  14th International Conference, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
Theor. Comput. Sci., 2009
SIAM J. Discret. Math., 2009
SIAM J. Discret. Math., 2009
Discret. Appl. Math., 2009
OnLine Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
Proceedings of the Structural Information and Communication Complexity, 2009
2008
J. Parallel Distributed Comput., 2008
J. Discrete Algorithms, 2008
J. Discrete Algorithms, 2008
Selfishness, collusion and power of local search for the ADMs minimization problem.
Comput. Networks, 2008
Proceedings of the Distributed Computing, 22nd International Symposium, 2008
On the Performance of Beauquier and Debas' Selfstabilizing Algorithm for Mutual Exclusion.
Proceedings of the Structural Information and Communication Complexity, 2008
Proceedings of the EuroPar 2008, 2008
2007
IEEE/ACM Trans. Netw., 2007
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem.
Theor. Comput. Sci., 2007
On minimizing the number of ADMs  Tight bounds for an algorithm without preprocessing.
J. Parallel Distributed Comput., 2007
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Distributed Computing, 21st International Symposium, 2007
On the Performance of Dijkstra's Third Selfstabilizing Algorithm for Mutual Exclusion.
Proceedings of the Stabilization, 2007
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
2005
Proceedings of the Structural Information and Communication Complexity, 2005
2004
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.
Proceedings of the 1st International Conference on Broadband Networks (BROADNETS 2004), 2004
2002
The complexity of the characterization of networks supporting shortestpath interval routing.
Theor. Comput. Sci., 2002
IEEE J. Sel. Areas Commun., 2002
2001
Comput. Artif. Intell., 2001
2000
Theor. Comput. Sci., 2000
Proceedings of the Distributed Computing, 14th International Conference, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000
1999
Theor. Comput. Sci., 1999
Networks, 1999
CoRR, 1999
1998
IEEE/ACM Trans. Netw., 1998
Theor. Comput. Sci., 1998
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load.
Parallel Process. Lett., 1998
Discret. Appl. Math., 1998
Algorithmica, 1998
1997
Algorithmica, 1997
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l<sub>1</sub>Spheres.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1997
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997
Duality in Chain ATM Virtual Path Layouts.
Proceedings of the SIROCCO'97, 1997
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
Proceedings of the Networks in Distributed Computing, 1997
1996
IEEE/ACM Trans. Netw., 1996
Chic. J. Theor. Comput. Sci., 1996
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996
On the Power of Local Information in Scheduling in Synchronous Networks.
Proceedings of the SIROCCO'96, 1996
Proceedings of the Proceedings IEEE INFOCOM '96, 1996
1995
Theor. Comput. Sci., 1995
Proceedings of the Algorithms, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
IEEE/ACM Trans. Netw., 1994
Theor. Comput. Sci., 1994
Networks, 1994
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994
Onthefly replay: a practical paradigm and its implementation for distributed debugging.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994
Path Layout in ATM Networks.
Proceedings of the Structural Information and Communication Complexity, 1994
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
J. Algorithms, 1993
Algorithmica, 1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Proceedings of the Algorithms  ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1992
A New Characterization of Tree Medians with Applications to Distributed Algorithms.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1992
1990
IEEE Trans. Software Eng., 1990
IEEE Trans. Commun., 1990
J. Algorithms, 1990
Eur. J. Comb., 1990
Proceedings of the GraphTheoretic Concepts in Computer Science, 1990
1989
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Theor. Comput. Sci., 1989
Inf. Process. Lett., 1989
Discret. Appl. Math., 1989
Algorithmica, 1989
1988
MinimumDiameter Cyclic Arrangements in Mapping DataFlow Graphs onto VLSI Arrays.
Math. Syst. Theory, 1988
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Inf. Comput., November, 1987
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors.
SIAM J. Comput., 1987
Proceedings of the Distributed Algorithms, 1987
Proceedings of the STACS 87, 1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Discret. Math., 1986
1985
IEEE Trans. Computers, 1985
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985
1984
BIT, 1984
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984
1983
Acta Informatica, 1983
1982
Theor. Comput. Sci., 1982
Inf. Process. Lett., 1982
Inf. Control., 1982
Discret. Math., 1982
1981
Discret. Math., 1981
Proceedings of the CAAP '81, 1981
1980
Theor. Comput. Sci., 1980
Discret. Math., 1980
1979
PhD thesis, 1979
SIAM J. Comput., 1979