Shay Kutten

According to our database1, Shay Kutten authored at least 132 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Message Reduction in the Local Model is a Free Lunch.
CoRR, 2019

Bayesian Generalized Network Design.
CoRR, 2019

Deterministic Leader Election in Programmable Matter.
CoRR, 2019

Maximizing Communication Throughput in Tree Networks.
CoRR, 2019

Hierarchical b-Matching.
CoRR, 2019

Reducing the Number of Messages in Self-stabilizing Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

2018
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.
SIAM J. Discrete Math., 2018

Set Cover and Vertex Cover with Delay.
CoRR, 2018

The Communication Cost of Information Spreading in Dynamic Networks.
CoRR, 2018

Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency.
CoRR, 2018

Brief Announcement: Time Efficient Self-stabilizing Stable Marriage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection.
Proceedings of the Structural Information and Communication Complexity, 2018

Efficient Jobs Dispatching in Emerging Clouds.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
Fast rendezvous on a cycle by agents with different speeds.
Theor. Comput. Sci., 2017

Data Collection in Population Protocols with Non-uniformly Random Scheduler.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Notions of Connectivity in Overlay Networks.
CoRR, 2016

Online Matching: Haste makes Waste!
CoRR, 2016

2015
Sublinear bounds for randomized leader election.
Theor. Comput. Sci., 2015

On the Complexity of Universal Leader Election.
J. ACM, 2015

Fast and compact self-stabilizing verification, computation, and fault detection of an MST.
Distributed Computing, 2015

Construction and impromptu repair of an MST in a distributed network with o(m) communication.
CoRR, 2015

Optimal competitiveness for the Rectilinear Steiner Arborescence problem.
CoRR, 2015

The Weakest Oracle for Symmetric Consensus in Population Protocols.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree.
CoRR, 2014

Distributed Symmetry Breaking in Hypergraphs.
CoRR, 2014

2013
Controller and estimator for dynamic networks.
Inf. Comput., 2013

Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems.
CoRR, 2013

Time Optimal Synchronous Self Stabilizing Spanning Tree.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Prudent Opportunistic Cognitive Radio Access Protocols.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Distributed Verification Using Mobile Agents.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Rendezvous of Agents with Different Speeds
CoRR, 2012

Composition games for distributed systems: The EU grant games (abstract).
Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
A self-stabilizing transformer for population protocols with covering.
Theor. Comput. Sci., 2011

Composition Games for Distributed Systems: the EU Grant games
CoRR, 2011

Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Distributed Decision Problems: The Locality Angle.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Capacity optimized NoC for multi-mode SoC.
Proceedings of the 48th Design Automation Conference, 2011

2010
Distributed error confinement.
ACM Trans. Algorithms, 2010

Proof labeling schemes.
Distributed Computing, 2010

Low Communication Self-stabilization through Randomization.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

On utilizing speed in networks of mobile agents.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
A note on models for graph representations.
Theor. Comput. Sci., 2009

Bounded-wait combining: constructing robust and high-throughput shared objects.
Distributed Computing, 2009

The 2009 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Making Population Protocols Self-stabilizing.
Proceedings of the Stabilization, 2009

Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Optimal maintenance of a spanning tree.
J. ACM, 2008

2007
Reducing human interactions in Web directory searches.
ACM Trans. Inf. Syst., 2007

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.
IEEE Trans. Dependable Sec. Comput., 2007

Map construction of unknown graphs by multiple agents.
Theor. Comput. Sci., 2007

Distributed verification of minimum spanning trees.
Distributed Computing, 2007

Asynchronous resource discovery in peer-to-peer networks.
Computer Networks, 2007

Output Stability Versus Time Till Output.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Time Optimal Asynchronous Self-stabilizing Spanning Tree.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006
Introduction to the special issue PODC'2004.
Distributed Computing, 2006

Labeling Schemes with Queries
CoRR, 2006

Constructing Shared Objects That Are Both Robust and High-Throughput.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Efficient Distributed Weighted Matchings on Trees.
Proceedings of the Structural Information and Communication Complexity, 2006

Scalable Self Stabilization.
Proceedings of the ITRE 2006, 2006

On Distributed Verification.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Improved Distributed Exploration of Anonymous Networks.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Adaptive Stabilization of Reactive Protocols.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Multicast group membership management.
IEEE/ACM Trans. Netw., 2003

Preface.
Theor. Comput. Sci., 2003

Deterministic Resource Discovery in Distributed Networks.
Theory Comput. Syst., 2003

Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract).
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations.
J. High Speed Networks, 2002

Optimal allocation of electronic content.
Computer Networks, 2002

2000
Tight Fault Locality.
SIAM J. Comput., 2000

Early Detection of Message Forwarding Faults.
SIAM J. Comput., 2000

The Las-Vegas Processor Identity Problem (How and When to Be Unique).
J. Algorithms, 2000

Deterministic distributed resource discovery (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
Fast broadcast in high-speed networks.
IEEE/ACM Trans. Netw., 1999

Worst-case analysis of dynamic wavelength allocation in optical networks.
IEEE/ACM Trans. Netw., 1999

Stabilizing Time-Adaptive Protocols.
Theor. Comput. Sci., 1999

Bandwidth Allocation with Preemption.
SIAM J. Comput., 1999

Fault-Local Distributed Mending.
J. Algorithms, 1999

Maintenance of a Spanning Tree in Dynamic Networks.
Proceedings of the Distributed Computing, 1999

Optimal Reactive k-Stabilization: The Case of Mutual Exclusion.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees.
SIAM J. Comput., 1998

Optimal Broadcast with Partial Knowledge.
SIAM J. Comput., 1998

Fast Distributed Construction of Small k-Dominating Sets and Applications.
J. Algorithms, 1998

Perfectly Secure Key Distribution for Dynamic Conferences.
Inf. Comput., 1998

Asynchronous Time-Adaptive Self Stabilization.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Optimal Allocation of Electronic Contect in Networks.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

k-Stabilization of Reactive Tasks.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
The Local Detection Paradigm and Its Application to Self-Stabilization.
Theor. Comput. Sci., 1997

Efficient On-Line Call Control Algorithms.
J. Algorithms, 1997

Time-Adaptive Self Stabilization.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Dynamic Wavelength Allocation in Optical Networks.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Dynamic Wavelength Allocation in All-Optical Ring Networks.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996
Scalable Fault Tolerance.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

1995
The KryptoKnight family of light-weight protocols for authentication and key distribution.
IEEE/ACM Trans. Netw., 1995

New models and algorithms for future networks.
IEEE Trans. Information Theory, 1995

A distributed control architecture of high-speed networks.
IEEE Trans. Communications, 1995

Greedy Packet Scheduling.
SIAM J. Comput., 1995

Optimal Broadcast with Partial Knowledge (Extended Abstract).
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Fast Distributed Construction of k-Dominating Sets and Applications.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Fault-Local Distributed Mending (Extended Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Tight Fault Locality (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
On buffer-economical store-and-forward deadlock prevention.
IEEE Trans. Communications, 1994

A New Competitive Algorithm for Group Testing.
Discrete Applied Mathematics, 1994

1993
Systematic Design of a Family of Attack-Resistant Authentication Protocols.
IEEE Journal on Selected Areas in Communications, 1993

Time optimal self-stabilizing synchronization.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Time Optimal Self-Stabilizing Spanning Tree Algorithms.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Competitive Distributed Job Scheduling (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Hardware Flooding (preliminary version).
Proceedings of the SIGCOMM '91, 1991

Efficient Deadlock-Free Routing.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Broadcast with Partial Knowledge (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Multicast group membership management in high speed wide area networks.
Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS 1991), 1991

Systematic Design of Two-Party Authentication Protocols.
Proceedings of the Advances in Cryptology, 1991

1990
Optimal Distributed t-Resilient Election in Complete Networks.
IEEE Trans. Software Eng., 1990

A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms.
ACM Trans. Program. Lang. Syst., 1990

Optimal Computation of Global Sensitive Functions in Fast Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Memory-Efficient Self Stabilizing Protocols for General Networks.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Distributed Control for PARIS.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Broadcast in Fast Networks.
Proceedings of the Proceedings IEEE INFOCOM '90, 1990

Communication-Optimal Maintenance of Replicated Information
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Fast Isolation of Arbitrary Forwarding Faults.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
Fault Tolerant Distributed Majority Commitment.
J. Algorithms, 1988

Optimal Fault-Tolerant Distributed Construction of a Spanning Forest.
Inf. Process. Lett., 1988

Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map.
Proceedings of the Computer Communication Technologies for the 90's, Proceedings of the Ninth International Conference on Computer Communication, Tel Aviv, Israel, October 30, 1988

1987
Tree-Based Broadcasting in Multihop Radio Networks.
IEEE Trans. Computers, 1987

Making Distributed Spanning Tree Algorithms Fault-Resilient.
Proceedings of the STACS 87, 1987

1985
On Broadcasting in Radio Networks-Problem Analysis and Protocol Design.
IEEE Trans. Communications, 1985


  Loading...