Shmuel Zaks
According to our database^{1},
Shmuel Zaks
authored at least 175 papers
between 1979 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at id.loc.gov
On csauthors.net:
Bibliography
2019
Maximizing Communication Throughput in Tree Networks.
CoRR, 2019
Hierarchical bMatching.
CoRR, 2019
2018
Flexible bandwidth assignment with application to optical networks.
J. Scheduling, 2018
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Representations of HolesPart II.
Discrete Mathematics & Theoretical Computer Science, 2018
Online Coalition Structure Generation in Graph Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
2017
Energyoptimal collaborative file distribution in wired networks.
PeertoPeer Networking and Applications, 2017
Online Regenerator Placement.
Theory Comput. Syst., 2017
Optimizing bandwidth allocation in elastic optical networks with application to scheduling.
J. Discrete Algorithms, 2017
Graphs of EdgeIntersecting and NonSplitting One Bend Paths in a Grid.
Discrete Mathematics & Theoretical Computer Science, 2017
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals.
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks.
IEEE Trans. Wireless Communications, 2016
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci., 2016
Graphs of edgeintersecting and nonsplitting paths.
Theor. Comput. Sci., 2016
Online maximum matching in complete multipartite graphs with an application to optical networks.
Discrete Applied Mathematics, 2016
On the intersection of tolerance and cocomparability graphs.
Discrete Applied Mathematics, 2016
On the complexity of the regenerator location problem treewidth and other parameters.
Discrete Applied Mathematics, 2016
Graphs of edgeintersecting nonsplitting paths in a tree: Representations of holes  Part I.
Discrete Applied Mathematics, 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
Optimizing busy time on parallel machines.
Theor. Comput. Sci., 2015
Designing Low Cost and Energy Efficient Access Network for the Developing World.
CoRR, 2015
Graphs of EdgeIntersecting and NonSplitting One Bend Paths in a Grid.
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
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Online Lower Bounds and Offline Inapproximability in Optical Networks.
Proceedings of the Adhoc, Mobile, and Wireless Networks  14th International Conference, 2015
2014
Online optimization of busy time on parallel machines.
Theor. Comput. Sci., 2014
On the complexity of constructing minimum changeover cost arborescences.
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
Interference coordination strategies for content update dissemination in LTEA.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014
Graphs of edgeintersecting and nonsplitting paths.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014
2013
Online Regenerator Placement.
CoRR, 2013
Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Representations of HolesPart II.
CoRR, 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
Profit Maximization in FlexGrid AllOptical Networks.
Proceedings of the Structural Information and Communication Complexity, 2013
2012
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw., 2012
Opportunistic information dissemination in mobile adhoc networks: the profit of global synchrony.
Distributed Computing, 2012
On the Intersection of Tolerance and Cocomparability Graphs
CoRR, 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
Online Optimization of Busy Time on Parallel Machines  (Extended Abstract).
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
Optimizing Busy Time on Parallel Machines.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012
2011
On the complexity of the regenerator placement problem in optical networks.
IEEE/ACM Trans. Netw., 2011
Optimizing regenerator cost in traffic grooming.
Theor. Comput. Sci., 2011
The Recognition of Tolerance and Bounded Tolerance Graphs.
SIAM J. Comput., 2011
Opportunistic Information Dissemination in Mobile Adhoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
CoRR, 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
Online Regenerator Placement.
Proceedings of the Principles of Distributed Systems  15th International Conference, 2011
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Proceedings of the Principles of Distributed Systems  15th International Conference, 2011
2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010
Optimal online colorings for minimizing the number of ADMs in optical networks.
J. Discrete Algorithms, 2010
On the performance of Dijkstra's third selfstabilizing algorithm for mutual exclusion and related algorithms.
Distributed Computing, 2010
The Recognition of Tolerance and Bounded Tolerance Graphs
CoRR, 2010
Opportunistic Information Dissemination in Mobile Adhoc Networks: The Profit of Global Synchrony.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
The Recognition of Tolerance and Bounded Tolerance Graphs.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Traffic Grooming in Star Networks via Matching Techniques.
Proceedings of the Structural Information and Communication Complexity, 2010
Optimizing Regenerator Cost in Traffic Grooming  (Extended Abstract).
Proceedings of the Principles of Distributed Systems  14th International Conference, 2010
On the Intersection of Tolerance and Cocomparability Graphs.
Proceedings of the Algorithms and Computation  21st International Symposium, 2010
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
Preface.
Theor. Comput. Sci., 2009
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
SIAM J. Discrete Math., 2009
More Patterns in Trees: Up and Down, Young and Old, Odd and Even.
SIAM J. Discrete Math., 2009
On minimizing the number of ADMs in a general topology optical network.
Discrete Applied Mathematics, 2009
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2009
On the complexity of the regenerator placement problem in optical networks.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 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
Minimizing total busy time in parallel scheduling with application to optical networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
2008
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distrib. Comput., 2008
Intersection representations of matrices by subtrees and unicycles on graphs.
J. Discrete Algorithms, 2008
Approximating the traffic grooming problem.
J. Discrete Algorithms, 2008
Selfishness, collusion and power of local search for the ADMs minimization problem.
Computer Networks, 2008
A Selfstabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.
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
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Proceedings of the EuroPar 2008, 2008
2007
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings.
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 Distrib. 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
Optimal OnLine Colorings for Minimizing the Number of ADMs in Optical Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
DISC at Its 20th Anniversary (Stockholm, 2006).
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
On the Complexity of the Traffic Grooming Problem in Optical Networks.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
2006
Approximating the Traffic Grooming Problem in Tree and Star Networks.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2006
On Minimizing the Number of ADMs in a General Topology Optical Network.
Proceedings of the Distributed Computing, 20th International Symposium, 2006
On Minimizing the Number of ADMs  Tight Bounds for an Algorithm Without Preprocessing.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006
2005
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.
Proceedings of the Structural Information and Communication Complexity, 2005
Approximating the Traffic Grooming Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 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
Lightpath arrangement in survivable rings to minimize the switching cost.
IEEE Journal on Selected Areas in Communications, 2002
2001
Design Issues in ATM and Optical Networks.
Computers and Artificial Intelligence, 2001
2000
On the totalkdiameter of connection networks.
Theor. Comput. Sci., 2000
Approximation Algorithms for Survivable Optical Networks.
Proceedings of the Distributed Computing, 14th International Conference, 2000
On the Use of Duality and Geometry in Layouts for ATM Networks.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Duality in ATM Layout Problems.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000
1999
Scheduling in Synchronous Networks and the Greedy Algorithm.
Theor. Comput. Sci., 1999
Lower bounds for linear interval routing.
Networks, 1999
Computation in an algebra of test selection criteria
CoRR, 1999
1998
Efficient support for client/server applications over heterogeneous ATM network.
IEEE/ACM Trans. Netw., 1998
Labelled Trees and Pairs of InputOutput Permutations in Priority Queues.
Theor. Comput. Sci., 1998
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load.
Parallel Processing Letters, 1998
Optimal layouts on a chain ATM network.
Discrete Applied Mathematics, 1998
Minimum Dominating Sets of Intervals on Lines.
Algorithmica, 1998
1997
The Bit Complexity of Distributed Sorting.
Algorithmica, 1997
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l_{1}Spheres.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1997
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract).
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
A Simple DFSBased Algorithm for Linear Interval Routing.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
Path Layout in ATM Networks.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997
Duality in Chain ATM Virtual Path Layouts.
Proceedings of the SIROCCO'97, 1997
The Complexity of Characterization of Networks Supporting ShortestPath Interval Routing.
Proceedings of the SIROCCO'97, 1997
On the total_{k}diameter of connection networks.
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
Path layout in ATM networksA survey.
Proceedings of the Networks in Distributed Computing, 1997
1996
The layout of virtual paths in ATM networks.
IEEE/ACM Trans. Netw., 1996
Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches.
Chicago J. Theor. Comput. Sci., 1996
A Lower Bound for Linear Interval Routing.
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
Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996
1995
Tight Bounds on the Round Complexity of Distributed 1Solvable Tasks.
Theor. Comput. Sci., 1995
Optimal Layouts on a Chain ATM Network (Extended Abstract).
Proceedings of the Algorithms, 1995
Minimum Dominating Sets of Intervals on Lines (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
Synchronizing ABD networks.
IEEE/ACM Trans. Netw., 1994
Optimal Bounds for the ChangeMaking Problem.
Theor. Comput. Sci., 1994
A new characterization of tree medians with applications to distributed sorting.
Networks, 1994
Labelled Trees and Pairs of InputOutput Permutations in Priority Queues.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1994
A Scalable Approach to Routing in ATM Networks.
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
The Virtual Path Layout Problem in Fast Networks (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
Optimal Linear Broadcast.
J. Algorithms, 1993
A Lower Bound on the Period Length of a Distributed Scheduler.
Algorithmica, 1993
Optimal Linear Broadcast Routing with Capacity Limitations.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Optimal Bounds for the ChangeMaking Problem.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
The Bit Complexity of Distributed Sorting (Extended Abstract).
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
Optimal Distributed tResilient Election in Complete Networks.
IEEE Trans. Software Eng., 1990
Synchronizing asynchronous bounded delay networks.
IEEE Trans. Communications, 1990
A Combinatorial Characterization of the Distributed 1Solvable Tasks.
J. Algorithms, 1990
The Cycle Lemma and Some Applications.
Eur. J. Comb., 1990
Deciding 1sovability of distributed task is NPhard.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1990
Tight Bounds on the Round Complexity of Distributed 1Solvable Tasks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990
Optimal Linear Broadcast.
Proceedings of the Algorithms, 1990
1989
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Theor. Comput. Sci., 1989
Bit Complexity of Order Statistics on a Distributed Star Network.
Inf. Process. Lett., 1989
Patterns in trees.
Discrete Applied Mathematics, 1989
Efficient Elections in Chordal Ring Networks.
Algorithmica, 1989
1988
MinimumDiameter Cyclic Arrangements in Mapping DataFlow Graphs onto VLSI Arrays.
Mathematical Systems 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
Optimal Synchronization of ABD Networks.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988
Analysis of a Distributed Scheduler for Communication Networks.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
On the Bit Complexity of Distributed Computations in a Ring with a Leader
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
Synchronizing Aysnchronous Bounded Delay Networks.
Proceedings of the Distributed Algorithms, 1987
Making Distributed Spanning Tree Algorithms FaultResilient.
Proceedings of the STACS 87, 1987
Guessing Games and Distributed Computations in Synchronous Networks.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Ordered trees and noncrossing partitions.
Discrete Mathematics, 1986
On the Bit Complexity of Distributed Computations in a Ring with a Leader.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986
1985
Optimal Distributed Algorithms for Sorting and Ranking.
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
A New Algorithm for Generation of Permutations.
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
Patterns in Trees.
Proceedings of the CAAP'84, 1984
1983
On Sets of Boolean n Projections Surjective.
Acta Inf., 1983
1982
On the Complexity of Edge Labelings for Trees.
Theor. Comput. Sci., 1982
Generation and Ranking of kary Trees.
Inf. Process. Lett., 1982
Fair Deriviations in ContextFree Grammars
Information and Control, 1982
Golden ratios in a pairs covering problem.
Discrete Mathematics, 1982
1981
Deficient generalized Fibonacci maximum path graphs.
Discrete Mathematics, 1981
Applied Tree Enumerations.
Proceedings of the CAAP '81, 1981
1980
Lexicographic Generation of Ordered Trees.
Theor. Comput. Sci., 1980
Enumerations of ordered trees.
Discrete Mathematics, 1980
1979
Generating Trees and Other Combinatorial Objects Lexicographically.
SIAM J. Comput., 1979