Shay Kutten
#59,352
Most Influential Person Now
Israeli computer scientist
Shay Kutten's AcademicInfluence.com Rankings
Shay Kuttencomputer-science Degrees
Computer Science
#2245
World Rank
#2339
Historical Rank
Distributed Computing
#9
World Rank
#10
Historical Rank
Database
#7891
World Rank
#8213
Historical Rank
Download Badge
Computer Science
Why Is Shay Kutten Influential?
(Suggest an Edit or Addition)According to Wikipedia, Shay Kutten is an Israeli computer scientist who holds the William M. Davidson Chair in Industrial Engineering and Management at the Technion – Israel Institute of Technology in Haifa, Israel. He is with the Faculty of Data and Decision Sciences. His research involves Network Algorithms, distributed computing, and Network Security.
Shay Kutten's Published Works
Published Works
- Perfectly-Secure Key Distribution for Dynamic Conferences (1992) (1076)
- Perfectly Secure Key Distribution for Dynamic Conferences (1998) (354)
- On Broadcasting in Radio Networks - Problem Analysis and Protocol Design (1985) (353)
- A sub-linear time distributed algorithm for minimum-weight spanning trees (1993) (247)
- Fast Distributed Construction of Small k-Dominating Sets and Applications (1998) (221)
- Proof labeling schemes (2005) (186)
- Systematic Design of Two-Party Authentication Protocols (1991) (172)
- Systematic Design of a Family of Attack-Resistant Authentication Protocols (1993) (163)
- Optimal allocation of electronic content (2001) (155)
- Time optimal self-stabilizing synchronization (1993) (149)
- Tree-Based Broadcasting in Multihop Radio Networks (1987) (148)
- Memory-Efficient Self Stabilizing Protocols for General Networks (1990) (147)
- Fault-Local Distributed Mending (1994) (116)
- The Local Detection Paradigm and Its Application to Self-Stabilization (1997) (111)
- A modular technique for the design of efficient distributed leader finding algorithms (1985) (110)
- The KryptoKnight family of light-weight protocols for authentication and key distribution (1995) (99)
- Fast distributed construction of k-dominating sets and applications (1995) (95)
- Time Optimal Self-Stabilizing Spanning Tree Algorithms (1993) (92)
- Worst-case analysis of dynamic wavelength allocation in optical networks (1999) (91)
- Time-adaptive self stabilization (1997) (88)
- Distributed verification of minimum spanning trees (2006) (86)
- Efficient on-line call control algorithms (1993) (86)
- Distributed control for PARIS (1990) (85)
- New models and algorithms for future networks (1995) (84)
- Bandwidth allocation with preemption (1995) (74)
- Dynamic wavelength allocation in all-optical ring networks (1997) (73)
- Map construction of unknown graphs by multiple agents (2007) (73)
- Sublinear bounds for randomized leader election (2012) (64)
- Online matching: haste makes waste! (2016) (61)
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication (2015) (55)
- Fault-local distributed mending (extended abstract) (1995) (54)
- Tight fault locality (1995) (54)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (2011) (52)
- Competitive distributed job scheduling (extended abstract) (1992) (49)
- On the complexity of universal leader election (2013) (47)
- Eecient On-line Call Control Algorithms (1993) (46)
- Stabilizing Time-Adaptive Protocols (1999) (41)
- Communication-optimal maintenance of replicated information (1990) (41)
- Deterministic Resource Discovery in Distributed Networks (2001) (38)
- A new competitive algorithm for group testing (1992) (37)
- On the Complexity of Universal Leader Election (2015) (37)
- A distributed control architecture of high-speed networks (1995) (36)
- A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock (2007) (34)
- On utilizing speed in networks of mobile agents (2010) (32)
- Distributed error confinement (2003) (32)
- Early Detection of Message Forwarding Faults (2000) (29)
- Asynchronous resource discovery in peer to peer networks (2002) (29)
- Optimal reactive k-stabilization: the case of mutual exclusion (1999) (28)
- Time Optimal Synchronous Self Stabilizing Spanning Tree (2007) (28)
- On buffer-economical store-and-forward deadlock prevention (1991) (27)
- Time Optimal Asynchronous Self-stabilizing Spanning Tree (2007) (27)
- Optimal maintenance of a spanning tree (2008) (26)
- A self-stabilizing transformer for population protocols with covering (2011) (25)
- Controller and estimator for dynamic networks (2007) (25)
- Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus (2005) (24)
- The Las-Vegas processor identity problem (how and when to be unique) (1993) (23)
- Greedy Packet Scheduling (1990) (23)
- Reducing human interactions in Web directory searches (2007) (21)
- Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map (1988) (21)
- Fast rendezvous on a cycle by agents with different speeds (2012) (20)
- Maintenance of a spanning tree in dynamic networks (1999) (20)
- Efficient Distributed Weighted Matchings on Trees (2006) (20)
- Making Distributed Spanning Tree Algorithms Fault-Resilient (1987) (20)
- Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract) (2003) (18)
- Optimal Distributed t-Resilient Election in Complete Networks (1990) (18)
- Multicast group membership management (2003) (17)
- Fault Tolerant Distributed Majority Commitment (1988) (17)
- Fast isolation of arbitrary forwarding faults (1989) (16)
- Broadcast in fast networks (1990) (16)
- Multicast group membership management in high speed wide area networks (1991) (16)
- Distributed Symmetry Breaking in Hypergraphs (2014) (15)
- k-stabilization of reactive tasks (1998) (14)
- Deterministic Leader Election in Programmable Matter (2019) (14)
- Making Population Protocols Self-stabilizing (2009) (13)
- Efficient deadlock-free routing (1991) (13)
- On Distributed Verification (2006) (12)
- Asynchronous time-adaptive self stabilization (1998) (12)
- Low Communication Self-stabilization through Randomization (2010) (12)
- Adaptive Stabilization of Reactive Protocols (2004) (10)
- Fast broadcast in high-speed networks (1999) (10)
- Optimal Fault-Tolerant Distributed Construction of a Spanning Forest (1988) (9)
- Proceedings of the 12th International Symposium on Distributed Computing (1998) (9)
- Deterministic distributed resource discovery (brief announcement) (2000) (8)
- Labeling Schemes with Queries (2006) (8)
- Optimal Broadcast with Partial Knowledge (1999) (8)
- Set Cover with Delay - Clairvoyance Is Not Required (2018) (8)
- Notions of Connectivity in Overlay Networks (2012) (7)
- Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs (2018) (7)
- Output Stability Versus Time Till Output (2007) (7)
- Constructing Shared Objects That Are Both Robust and High-Throughput (2006) (7)
- Optimal Computation of Global Sensitive Functions in Fast Networks (1991) (7)
- Fault Tolerant Leader Election with Termination Detection, in General Undirected Networks (1986) (6)
- Broadcast with partial knowledge (preliminary version) (1991) (6)
- Distributed error confinement (2010) (6)
- The Communication Cost of Information Spreading in Dynamic Networks (2018) (6)
- Online Paging with a Vanishing Regret (2020) (5)
- Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed (2009) (5)
- Hierarchical b-Matching (2019) (4)
- Efficient Deterministic Leader Election for Programmable Matter (2021) (4)
- A note on models for graph representations (2009) (4)
- Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree (2014) (4)
- Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency (2020) (3)
- Bounded-wait combining: constructing robust and high-throughput shared objects (2009) (3)
- Dynamic Wavelength Allocation in Optical Networks. (1997) (3)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (2017) (3)
- Scalable Fault Tolerance (1996) (3)
- Tight Fault Locality (Extended Abstract) (1995) (3)
- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs (2012) (3)
- Dynamic wavelength conversion in optical networks (1997) (2)
- Distributed Verification Using Mobile Agents (2013) (2)
- An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects (2010) (2)
- Singularly Optimal Randomized Leader Election (2020) (2)
- Capacity optimized NoC for multi-mode SoC (2011) (2)
- The Las-Vegas Processor Identity Problem (2004) (2)
- Communication Efficient Self-Stabilizing Leader Election (2020) (2)
- Self-stabilization in Eulerian Networks with Cut-through Constraints (1999) (2)
- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (2013) (2)
- Reducing the Number of Messages in Self-stabilizing Protocols (2019) (2)
- Optimal allocation of electronic content in networks (1998) (2)
- Time Efficient Self-stabilizing Stable Marriage (2016) (1)
- Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games (2011) (1)
- Communication Efficient Self-Stabilizing Leader Election (Full Version) (2020) (1)
- Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004 (2004) (1)
- Distributed computing : 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998 : proceedings (1998) (1)
- Set Cover and Vertex Cover with Delay (2018) (1)
- Efficient Jobs Dispatching in Emerging Clouds (2018) (1)
- Energy-optimal online algorithms for broadcasting in wireless networks (2005) (1)
- Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers (2010) (1)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (2018) (1)
- Approximating generalized network design under (dis)economies of scale with applications to energy efficiency (2018) (1)
- Fully Adaptive Self-Stabilizing Transformer for LCL Problems (2021) (1)
- Prudent Opportunistic Cognitive Radio Access Protocols (2013) (1)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (2015) (1)
- Hardware flooding (preliminary version) (1991) (1)
- Message authentication method and communication system (1994) (1)
- Improved Distributed Exploration of Anonymous Networks (2006) (1)
- Message Reduction in the LOCAL Model is a Free Lunch (2019) (1)
- Online Matching: Haste makes Waste! (Full Version)∗ (2016) (1)
- Rendezvous of Agents with Different Speeds (2012) (1)
- Improved Tradeoffs for Leader Election (2023) (1)
- Composition games for distributed systems: The EU grant games (abstract) (2011) (1)
- Optimal Allocation of Electronic Content (Extended Abstract) (2000) (1)
- Distributed Exploration of Anonymous Graphs by Multiple Agents ∗ (2006) (1)
- Locally Restricted Proof Labeling Schemes (Full Version) (2022) (1)
- The Weakest Oracle for Symmetric Consensus in Population Protocols (2015) (1)
- Singularly Near Optimal Leader Election in Asynchronous Networks (2021) (1)
- Locally Restricted Proof Labeling Schemes (2022) (0)
- Distributed Decision Problems: The Locality Angle (2011) (0)
- Structural Information and Communication Complexity (2012) (0)
- Reactive Pls for Distributed Decision (2021) (0)
- Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection (2018) (0)
- On Time Adaptivity and Stabilization (2008) (0)
- Optimal Broadcast with Partial Knowledge (Extended Abstract) (1995) (0)
- Method for confirming user in communication network and device therefor (1992) (0)
- Communication network management system (1993) (0)
- Efficient methods for distributed leader election and spanning tree construction (1988) (0)
- Scalable Self Stabilization (2006) (0)
- The Local Detection Paradigm for Self Stabilization (1994) (0)
- Distributed Spanning Tree Algorithms Fault-resilient (1987) (0)
- No-Regret Stateful Posted Pricing (2020) (0)
- Distributed Exploration of Unlabelled Graphs by Multiple Agents ∗ (2006) (0)
- Brief Announcement: Time Efficient Self-stabilizing Stable Marriage (2018) (0)
- An Almost Singularly Optimal Asynchronous Distributed MST Algorithm (2022) (0)
- Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints (2019) (0)
- Method and apparatus for mutual authentication of users in a communication system (1992) (0)
- Proceedings of the 16th international conference on Structural Information and Communication Complexity (2009) (0)
- Ciphering method and device (1994) (0)
- The 2013 principles of distributed computing doctoral dissertation award (2013) (0)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (2015) (0)
- Certificat d'echange pour validation unidirectionnelle d'informations (1994) (0)
- Efficient On-line Call Control Algorithms (Extended Abstract) (1993) (0)
- Introduction to the special issue PODC'2004 (2006) (0)
- 140 : 2 Deterministic Leader Election in Programmable Matter 1 (2019) (0)
- Reactive Proof Labeling Schemes for Distributed Decision (2020) (0)
- Tree-Based Broa ( lcasting in Multihop Radio (1987) (0)
- Method and system for secure distribution of program (1995) (0)
- The 2009 Edsger W. Dijkstra Prize in Distributed Computing (2009) (0)
- Deterministic Resource Discovery in Distributed Networks Extended Abstract] (2001) (0)
- Systematic 0 esign of a Family of Attack-Resistant Authentication Protocols September 1992 (1992) (0)
- Invited Paper: Reactive PLS for Distributed Decision (2020) (0)
- Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations (2002) (0)
- Multicast Communications with Varying Bandwidth Constraints (2021) (0)
- On ddistributed verification (2006) (0)
- Method for protective distribution of multimedia title and system therefor (1995) (0)
- Method and system for key distribution and authentication in a data transmission system (1993) (0)
- New Results - Non-self-stabilizing and self-stabilizinggathering in networks of mobile agents–the notion of speed (2011) (0)
- Maximizing Communication Throughput in Tree Networks (2019) (0)
- On Time Adaptivity and Stabilization (Algorithm Engineering as a New Paradigm) (2001) (0)
- Communication network with distributed management (1993) (0)
- Optimal Allocation of Electronic Content (an Earlier Draft With More Examples) (2001) (0)
- Coloring and Maximal Independent Set (MIS). (0)
- Energy Efficient Online Algorithms for Broadcasting in Wireless Networks (2005) (0)
- Bayesian Generalized Network Design (2019) (0)
This paper list is powered by the following services:
Other Resources About Shay Kutten
What Schools Are Affiliated With Shay Kutten?
Shay Kutten is affiliated with the following schools: