The following pages link to Shay Kutten (Q477100):
Displayed 50 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- Asynchronous resource discovery in peer-to-peer networks (Q856729) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Optimal fault-tolerant distributed construction of a spanning forest (Q1105570) (← links)
- Perfectly secure key distribution for dynamic conferences (Q1273875) (← links)
- Stabilizing time-adaptive protocols (Q1292427) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- Message-efficient self-stabilizing transformer using snap-stabilizing quiescence detection (Q1713879) (← links)
- Deterministic resource discovery in distributed networks (Q1879187) (← links)
- Controller and estimator for dynamic networks (Q1951592) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Bounded-wait combining: constructing robust and high-throughput shared objects (Q2377268) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication (Q2796243) (← links)
- Optimal reactive <i>k</i> -stabilization (Q2942764) (← links)
- Efficient On-Line Call Control Algorithms (Q3128992) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs (Q3167030) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- Optimal maintenance of a spanning tree (Q3452184) (← links)
- Time Optimal Asynchronous Self-stabilizing Spanning Tree (Q3523201) (← links)
- Output Stability Versus Time Till Output (Q3523218) (← links)
- Constructing Shared Objects That Are Both Robust and High-Throughput (Q3524323) (← links)
- Low Communication Self-stabilization through Randomization (Q3588323) (← links)
- Efficient Distributed Weighted Matchings on Trees (Q3613648) (← links)
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design (Q3703810) (← links)
- (Q3753476) (← links)
- Fault tolerant distributed majority commitment (Q3813293) (← links)
- Optimal Broadcast with Partial Knowledge (Q4210163) (← links)
- Fast Distributed Construction of Smallk-Dominating Sets and Applications (Q4216145) (← links)
- Fault-Local Distributed Mending (Q4228289) (← links)
- (Q4234111) (← links)
- (Q4252756) (← links)
- Bandwidth Allocation with Preemption (Q4268843) (← links)
- (Q4318716) (← links)
- Greedy Packet Scheduling (Q4326859) (← links)
- (Q4331289) (← links)
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Q4388873) (← links)
- Tight Fault Locality (Q4507347) (← links)
- Early Detection of Message Forwarding Faults (Q4507389) (← links)
- The Las-Vegas Processor Identity Problem (How and When to Be Unique) (Q4521525) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- New models and algorithms for future networks (Q4836904) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)