Structural Information and Communication Complexity

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Realizability of Graph Specifications: Characterizations and Algorithms
3. Altmetric Badge
   Chapter 2 A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
4. Altmetric Badge
   Chapter 3 Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection
5. Altmetric Badge
   Chapter 4 Constant-Space Self-stabilizing Token Distribution in Trees
6. Altmetric Badge
   Chapter 5 Distributed Counting Along Lossy Paths Without Feedback
7. Altmetric Badge
   Chapter 6 Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN
8. Altmetric Badge
   Chapter 7 Brief Announcement: Fast Approximate Counting and Leader Election in Populations
9. Altmetric Badge
   Chapter 8 One-Max Constant-Probability Networks: Results and Future Work
10. Altmetric Badge
    Chapter 9 Reaching Distributed Equilibrium with Limited ID Space
11. Altmetric Badge
    Chapter 10 Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)
12. Altmetric Badge
    Chapter 11 A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in $$O(\log n)$$ Time
13. Altmetric Badge
    Chapter 12 Simple and Local Independent Set Approximation
14. Altmetric Badge
    Chapter 13 On the Strongest Message Adversary for Consensus in Directed Dynamic Networks
15. Altmetric Badge
    Chapter 14 Symmetric Rendezvous with Advice: How to Rendezvous in a Disk
16. Altmetric Badge
    Chapter 15 Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model
17. Altmetric Badge
    Chapter 16 Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings
18. Altmetric Badge
    Chapter 17 Explorable Families of Graphs
19. Altmetric Badge
    Chapter 18 A Characterization of t -Resilient Colorless Task Anonymous Solvability
20. Altmetric Badge
    Chapter 19 Deterministic Distributed Ruling Sets of Line Graphs
21. Altmetric Badge
    Chapter 20 Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree
22. Altmetric Badge
    Chapter 21 A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\log N\log \varDelta /\log ^2\log \varDelta )$$ Rounds
23. Altmetric Badge
    Chapter 22 Online Service with Delay on a Line
24. Altmetric Badge
    Chapter 23 Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup
25. Altmetric Badge
    Chapter 24 Communication Complexity in Vertex Partition Whiteboard Model
26. Altmetric Badge
    Chapter 25 Time-Bounded Influence Diffusion with Incentives
27. Altmetric Badge
    Chapter 26 Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis
28. Altmetric Badge
    Chapter 27 On Knowledge and Communication Complexity in Distributed Systems
29. Altmetric Badge
    Chapter 28 Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique
30. Altmetric Badge
    Chapter 29 Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O (1) Clocks
31. Altmetric Badge
    Chapter 30 Gathering in the Plane of Location-Aware Robots in the Presence of Spies
32. Altmetric Badge
    Chapter 31 Formalizing Compute-Aggregate Problems in Cloud Computing
33. Altmetric Badge
    Chapter 32 Priority Evacuation from a Disk Using Mobile Robots