334 results on '"Shay Kutten"'
Search Results
2. The Impact of Asynchrony on Stability of MAC.
3. Improved Tradeoffs for Leader Election.
4. Tight Bounds on the Message Complexity of Distributed Tree Verification.
5. Tight Bounds on the Message Complexity of Distributed Tree Verification.
6. Locally Restricted Proof Labeling Schemes.
7. An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.
8. Singularly Near Optimal Leader Election in Asynchronous Networks.
9. Efficient Deterministic Leader Election for Programmable Matter.
10. Hierarchical b-Matching.
11. Online Paging with a Vanishing Regret.
12. Multicast Communications with Varying Bandwidth Constraints.
13. Communication Efficient Self-Stabilizing Leader Election.
14. Singularly Optimal Randomized Leader Election.
15. Set Cover with Delay - Clairvoyance Is Not Required.
16. Invited Paper: Reactive PLS for Distributed Decision.
17. Locally Restricted Proof Labeling Schemes (Full Version).
18. Deterministic Leader Election in Programmable Matter.
19. Message Reduction in the LOCAL Model Is a Free Lunch.
20. Bayesian Generalized Network Design.
21. The Communication Cost of Information Spreading in Dynamic Networks.
22. Reducing the Number of Messages in Self-stabilizing Protocols.
23. Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency.
24. Bayesian generalized network design.
25. Data collection in population protocols with non-uniformly random scheduler.
26. Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection.
27. Approximating generalized network design under (dis)economies of scale with applications to energy efficiency.
28. Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs.
29. Efficient Jobs Dispatching in Emerging Clouds.
30. Brief Announcement: Time Efficient Self-stabilizing Stable Marriage.
31. Fully Adaptive Self-Stabilizing Transformer for LCL Problems.
32. Data Collection in Population Protocols with Non-uniformly Random Scheduler.
33. Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.
34. No-Regret Stateful Posted Pricing.
35. Reactive Proof Labeling Schemes for Distributed Decision.
36. Online Paging with a Vanishing Regret.
37. Communication Efficient Self-Stabilizing Leader Election (Full Version).
38. Online matching: haste makes waste!
39. Fast rendezvous on a cycle by agents with different speeds.
40. Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem.
41. Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication.
42. The Weakest Oracle for Symmetric Consensus in Population Protocols.
43. Maximizing Communication Throughput in Tree Networks.
44. Hierarchical b-Matching.
45. Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems.
46. Distributed Symmetry Breaking in Hypergraphs.
47. Fast Rendezvous on a Cycle by Agents with Different Speeds.
48. Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree.
49. Prudent Opportunistic Cognitive Radio Access Protocols.
50. Time Optimal Synchronous Self Stabilizing Spanning Tree.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.