Shmuel Zaks

Q: What Schools Are Affiliated With Shmuel Zaks

Shmuel Zaks is affiliated with the following schools: Technion – Israel Institute of Technology, University of Illinois Urbana-Champaign

Shmuel Zaks's AcademicInfluence.com Rankings

Shmuel Zaks

Computer Science

#2923

World Rank

#3060

Historical Rank

Database

#8435

World Rank

#8829

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Shmuel Zaks Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Schmuel Zaks is a computer scientist and mathematician who works in the fields of distributed computing and computer networks. He is a professor at Technion – Israel Institute of Technology, where he holds the Joan Callner-Miller Chair in Computer Science.

(See a Problem?)

Shmuel Zaks's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Lexicographic Generation of Ordered Trees (1980) (173)
Tight lower and upper bounds for some distributed algorithms for a complete network of processors (1984) (129)
A Combinatorial Characterization of the Distributed 1-Solvable Tasks (1990) (96)
Enumerations of ordered trees (1980) (85)
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor (1988) (78)
The Cycle Lemma and Some Applications (1990) (77)
Minimizing total busy time in parallel scheduling with application to optical networks (2009) (69)
On the Complexity of the Regenerator Placement Problem in Optical Networks (2009) (66)
The layout of virtual paths in ATM networks (1996) (62)
Optimal Distributed Algorithms for Sorting and Ranking (1985) (53)
The virtual path layout problem in fast networks (extended abstract) (1994) (53)
A new algorithm for generation of permutations (1984) (52)
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors (1989) (51)
Generating Trees and Other Combinatorial Objects Lexicographically (1979) (50)
A New Intersection Model and Improved Algorithms for Tolerance Graphs (2009) (43)
Ordered trees and non-crossing partitions (1986) (40)
Optimizing Busy Time on Parallel Machines (2012) (39)
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors (1987) (39)
A Scalable Approach to Routing in ATM Networks (1994) (38)
Generation and Ranking of k-ary Trees (1982) (36)
Optimal layouts on a chain ATM network (1998) (36)
Lightpath arrangement in survivable rings to minimize the switching cost (2002) (34)
The Recognition of Tolerance and Bounded Tolerance Graphs (2010) (33)
Approximating the traffic grooming problem (2005) (32)
The complexity of the characterization of networks supporting shortest-path interval routing (2002) (30)
Online optimization of busy time on parallel machines (2014) (30)
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (2010) (29)
Optimal Bounds for the Change-Making Problem (1991) (29)
A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings (2004) (28)
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (1998) (25)
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (2010) (22)
Synchronizing asynchronous bounded delay networks (1990) (21)
Approximating the traffic grooming problem in tree and star networks (2006) (20)
Making Distributed Spanning Tree Algorithms Fault-Resilient (1987) (20)
Online Coalition Structure Generation in Graph Games (2018) (19)
Practical and deployment issues to be considered in regenerator placement and operation of translucent optical networks (2010) (18)
Optimal Distributed t-Resilient Election in Complete Networks (1990) (18)
Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks (2016) (18)
On sets of Boolean n-vectors with all k-projections surjective (1983) (18)
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs (2008) (18)
On-the-fly replay: a practical paradigm and its implementation for distributed debugging (1994) (18)
Synchronizing Aysnchronous Bounded Delay Networks (1990) (18)
Scheduling in Synchronous Networks and the Greedy Algorithm (1999) (17)
A Lower Bound for Linear Interval Routing (1996) (17)
Applied Tree Enumerations (1981) (17)
Interference coordination strategies for content update dissemination in LTE-A (2014) (17)
Guessing Games and Distributed Computations in Synchronous Networks (1987) (17)
Patterns in trees (1989) (16)
On the Complexity of the Traffic Grooming Problem in Optical Networks (2007) (16)
On the complexity of the regenerator placement problem in optical networks (2011) (16)
Path layout in ATM networks-A survey (1997) (15)
A lower bound on the period length of a distributed scheduler (1993) (15)
Duality in Chain ATM Virtual Path Layouts (1997) (15)
Path Layout in ATM Networks (1997) (15)
A New Characterization of Tree Medians with Applications to Distributed Algorithms (1991) (14)
A new characterization of tree medians with applications to distributed sorting (1994) (14)
On the bit complexity of distributed computations in a ring with a leader (1986) (13)
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres (1997) (13)
On minimizing the number of ADMs in a general topology optical network (2006) (13)
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing (2006) (12)
Optimizing regenerator cost in traffic grooming (2011) (12)
Online Regenerator Placement (2011) (12)
The Structure of the Intersection of Tolerance and Cocomparability Graphs (2010) (12)
Constructing minimum changeover cost arborescenses in bounded treewidth graphs (2016) (12)
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks (1990) (12)
Efficient elections in chordal ring networks (1989) (12)
Optimal Layouts on a Chain ATM Network (Extended Abstract) (1995) (11)
An NP-complete matching problem (1980) (11)
Lower bounds for linear interval routing (1999) (11)
On the complexity of constructing minimum changeover cost arborescences (2014) (11)
Optimal Virtual Path Layout in ATM Networks With Shared Routing Table Switches (1996) (11)
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling (2014) (11)
Approximation Algorithms for Survivable Optical Networks (2000) (11)
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract) (1997) (11)
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues (1994) (10)
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring (2008) (9)
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract) (2012) (9)
Lower Bounds on Common Knowledge in Distributed Algorithms (1984) (8)
Optimal on-line colorings for minimizing the number of ADMs in optical networks (2007) (8)
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism (2011) (8)
A 10/7 + $ \epsilon$ Approximation for Minimizing the Number of ADMs in SONET Rings (2007) (8)
Optimal Synchronization of ABD Networks (1988) (8)
Flexible bandwidth assignment with application to optical networks (2018) (8)
A 7 / 5 + ǫ Approximation Scheme for Minimizing the Number of ADMs in SONET Rings (2011) (7)
Selfishness, collusion and power of local search for the ADMs minimization problem (2007) (7)
Deciding 1-sovability of distributed task is NP-hard (1990) (7)
On the Complexity of Edge Labelings for Trees (1982) (7)
Optimal Linear Broadcast (1990) (7)
The Bit Complexity of Distributed Sorting (1997) (7)
Fair Deriviations in Context-Free Grammars (1982) (6)
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract) (1997) (6)
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors (1985) (6)
A Simple DFS-Based Algorithm for Linear Interval Routing (1997) (6)
Analysis of a Distributed Scheduler for Communication Networks (1988) (6)
Deciding 1-solvability of distributed task is NP-hard (extended abstract) (1991) (6)
Deficient generalized Fibonacci maximum path graphs (1981) (5)
Golden ratios in a pairs covering problem (1982) (5)
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays (1988) (5)
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion (2007) (5)
Proceedings of the 6th International Workshop on Distributed Algorithms (1992) (5)
Efficient support for client/server applications over heterogeneous ATM network (1998) (5)
Profit Maximization in Flex-Grid All-Optical Networks (2013) (5)
SENSE OF DIRECTION AND COMMUNICATION COMPLEXITY IN DISTRIBUTED NETWORKS (2004) (5)
Hierarchical b-Matching (2019) (4)
More Patterns in Trees: Up and Down, Young and Old, Odd and Even (2008) (4)
Efficient support for the client/server paradigm over heterogeneous ATM networks (1996) (4)
Energy-optimal collaborative file distribution in wired networks (2017) (4)
Bit Complexity of Order Statistics on a Distributed Star Network (1989) (4)
Intersection representations of matrices by subtrees and unicycles on graphs (2008) (3)
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals (2019) (3)
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid (2015) (3)
On the totalk-diameter of connection networks (2000) (3)
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract) (2013) (3)
On the intersection of tolerance and cocomparability graphs (2010) (3)
Traffic Grooming: Combinatorial Results and Practical Resolutions (2010) (3)
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion (2008) (3)
On the Power of Local Information in Scheduling in Synchronous Networks (1996) (2)
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms (2010) (2)
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem (2007) (2)
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract) (2010) (2)
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract) (2012) (2)
On the total/sub k/-diameter of connection networks (1997) (2)
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (2009) (2)
Minimizing the Number of ADMsWith and Without Traffic Grooming: Complexity and Approximability (2006) (2)
Flexible bandwidth assignment with application to optical networks (2014) (2)
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I (2013) (2)
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming (2011) (2)
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (2012) (1)
On-line maximum matching in complete multi-partite graphs with an application to optical networks (2016) (1)
Graphs of edge-intersecting and non-splitting paths (2016) (1)
Optimizing bandwidth allocation in elastic optical networks with application to scheduling (2017) (1)
Energy-optimal collaborative file distribution in wired networks (2016) (1)
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings (2007) (1)
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation (2021) (1)
On the Online Coalition Structure Generation Problem (2021) (1)
Finding a minimum spanning tree can be harder than finding a spanning tree in a distributed network (1983) (1)
On the Complexity of Constructing Minimum Reload Cost Path-Trees (2012) (1)
On the complexity of the regenerator location problem treewidth and other parameters (2016) (1)
Profit Maximization in Flex-Grid All-Optical Networks (2019) (1)
Minimum Dominating Sets of Intervals on Lines (1998) (1)
Distributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings (1992) (1)
Regenerator Cost Optimization in Path Networks With Traffic Grooming ∗ (2010) (0)
On Sets of Boolean n -Projections Surjective (1983) (0)
Distributed Spanning Tree Algorithms Fault-resilient (1987) (0)
Maximizing Communication Throughput in Tree Networks (2019) (0)
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings (2007) (0)
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput (2005) (0)
Multicast Communications with Varying Bandwidth Constraints (2021) (0)
Design Issues in ATM and Optical Networks (2001) (0)
The Bit Complexity of Distributed Sorting (Extended Abstract) (1993) (0)
North-Holland 125 NOTE (2001) (0)
DECIDING I·SOLVABILITY OF DISTRIBUTED TASKS IS NP.HARD (2014) (0)
Paths in ATM Networks (1996) (0)
Maximizing Bandwidth provision in interval scheduling with application to optical networks (2013) (0)
SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches (2016) (0)
Optimal Linear Broadcast Routing with Capacity Limitations (1993) (0)
Duality in ATM Layout Problems (2000) (0)
DISC at Its 20th Anniversary (Stockholm, 2006) (2007) (0)
Designing Low Cost and Energy Efficient Access Network for the Developing World (2015) (0)
Traffic Grooming in Star Networks via Matching Techniques (2010) (0)
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming (2012) (0)
On the Use of Duality and Geometry in Layouts for ATM Networks (2000) (0)
Proceedings of the 14th international conference on Structural information and communication complexity (2007) (0)
Panel on the contributions of the DISC community to distributed computing: a historical perspective (2006) (0)
Preface (2009) (0)
The Layout of Virtual Paths in ATM (2018) (0)
Robust Asynchronous Algorithms in Networks with a Fault Detection Ring (1994) (0)
TIGHT BOUNDS ON THE ROUND COMPARE OF DISTHBUTED 1-SOLVABLE TASKS∗ (2004) (0)
Special Issue of Structural Information and Communication Complexity (SIROCCO 2007), Theoretical Computer Science (2009) (0)
Minimum Dominating Sets of Intervals on Lines (Extended Abstract) (1995) (0)
Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints (2019) (0)
Interval scheduling to maximize bandwidth provision (2013) (0)
Computation in an algebra of test selection criteria (1999) (0)
FROM RINGS TO COMPLETE GRAPHS · e ( nlogn ) TO e ( n ) DISTRIBUTED LEADER ELECTI . ON (2012) (0)
Online Regenerator Placement (2016) (0)
Optimal parallel scheduling (2013) (0)
Online Lower Bounds and Offline Inapproximability in Optical Networks (2015) (0)
DISC at its 20th anniversary: past, present and future (2006) (0)
Designing the Virtual Path Layout in ATM Networks ? (0)
On-line studies in optical networks (2013) (0)
Chapter 2 Traffic Grooming : Combinatorial Results and Practical Resolutions (2018) (0)
Approximation algorithms for maximum weight k-coverings of graphs by packings (2021) (0)
Studies in Graph Algorithms: Generation and Labeling Problems (1979) (0)
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (2015) (0)
THE ROUND COMPLEXITY OF lS 0 LVABLE TASKS (2014) (0)

This paper list is powered by the following services:

Other Resources About Shmuel Zaks

en.wikipedia.org

What Schools Are Affiliated With Shmuel Zaks?

Shmuel Zaks is affiliated with the following schools: