↓ Skip to main content

Distributed Computing

Overview of attention for book
Cover of 'Distributed Computing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The 2009 Edsger W. Dijkstra Prize in Distributed Computing
  3. Altmetric Badge
    Chapter 2 Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement!
  4. Altmetric Badge
    Chapter 3 What Agreement Problems Owe Michel
  5. Altmetric Badge
    Chapter 4 Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing
  6. Altmetric Badge
    Chapter 5 Shmuel Zaks - The Mathematician, Computer Scientist and Personality
  7. Altmetric Badge
    Chapter 6 The Disagreement Power of an Adversary
  8. Altmetric Badge
    Chapter 7 New Bounds for the Controller Problem
  9. Altmetric Badge
    Chapter 8 On Set Consensus Numbers
  10. Altmetric Badge
    Chapter 9 The Abstract MAC Layer
  11. Altmetric Badge
    Chapter 10 Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
  12. Altmetric Badge
    Chapter 11 Interrupting Snapshots and the Java $^{\mbox{\tiny TM}}$ Size() Method
  13. Altmetric Badge
    Chapter 12 Elastic Transactions
  14. Altmetric Badge
    Chapter 13 Brief Announcement: Transactional Scheduling for Read-Dominated Workloads
  15. Altmetric Badge
    Chapter 14 Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
  16. Altmetric Badge
    Chapter 15 The RedBlue Adaptive Universal Constructions
  17. Altmetric Badge
    Chapter 16 Help When Needed, But No More: Efficient Read/Write Partial Snapshot
  18. Altmetric Badge
    Chapter 17 Contention-Sensitive Data Structures and Algorithms
  19. Altmetric Badge
    Chapter 18 Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms
  20. Altmetric Badge
    Chapter 19 Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset
  21. Altmetric Badge
    Chapter 20 Local Computation of Nearly Additive Spanners
  22. Altmetric Badge
    Chapter 21 A Local 2-Approximation Algorithm for the Vertex Cover Problem
  23. Altmetric Badge
    Chapter 22 Distributed Discovery of Large Near-Cliques
  24. Altmetric Badge
    Chapter 23 Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
  25. Altmetric Badge
    Chapter 24 Brief Announcement: Decidable Graph Languages by Mediated Population Protocols
  26. Altmetric Badge
    Chapter 25 Brief Announcement: Towards Secured Distributed Polling in Social Networks
  27. Altmetric Badge
    Chapter 26 What Can Be Observed Locally?
  28. Altmetric Badge
    Chapter 27 At-Most-Once Semantics in Asynchronous Shared Memory
  29. Altmetric Badge
    Chapter 28 Nonblocking Algorithms and Backward Simulation
  30. Altmetric Badge
    Chapter 29 Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction
  31. Altmetric Badge
    Chapter 30 Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison
  32. Altmetric Badge
    Chapter 31 Dynamics in Network Interaction Games
  33. Altmetric Badge
    Chapter 32 Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers
  34. Altmetric Badge
    Chapter 33 On the Existence of Weakest Failure Detectors for Mutual Exclusion and k -Exclusion
  35. Altmetric Badge
    Chapter 34 Crash-Quiescent Failure Detection
  36. Altmetric Badge
    Chapter 35 The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
  37. Altmetric Badge
    Chapter 36 Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model
  38. Altmetric Badge
    Chapter 37 Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
  39. Altmetric Badge
    Chapter 38 Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing ( k -)Set Agreement
  40. Altmetric Badge
    Chapter 39 Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol
  41. Altmetric Badge
    Chapter 40 Compact Multicast Routing
  42. Altmetric Badge
    Chapter 41 Compact Routing in Power-Law Graphs
  43. Altmetric Badge
    Chapter 42 Virtual Ring Routing Trends
  44. Altmetric Badge
    Chapter 43 A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
  45. Altmetric Badge
    Chapter 44 Euler Tour Lock-In Problem in the Rotor-Router Model
  46. Altmetric Badge
    Chapter 45 Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
  47. Altmetric Badge
    Chapter 46 On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
  48. Altmetric Badge
    Chapter 47 From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
  49. Altmetric Badge
    Chapter 48 Brief Announcement: A Leader-free Byzantine Consensus Algorithm
  50. Altmetric Badge
    Chapter 49 Efficient k-Shot Broadcasting in Radio Networks
  51. Altmetric Badge
    Chapter 50 Keeping Mobile Robot Swarms Connected
  52. Altmetric Badge
    Chapter 51 Consensus and Mutual Exclusion in a Multiple Access Channel
  53. Altmetric Badge
    Chapter 52 Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks
  54. Altmetric Badge
    Chapter 53 Brief Announcement: The Speed of Broadcasting in Random Networks – Density Does Not Matter
Attention for Chapter 44: Euler Tour Lock-In Problem in the Rotor-Router Model
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
6 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Euler Tour Lock-In Problem in the Rotor-Router Model
Chapter number 44
Book title
Distributed Computing
Published in
Lecture notes in computer science, January 2009
DOI 10.1007/978-3-642-04355-0_44
Book ISBNs
978-3-64-204354-3, 978-3-64-204355-0
Authors

Bampas, Evangelos, Gąsieniec, Leszek, Hanusse, Nicolas, Ilcinkas, David, Klasing, Ralf, Kosowski, Adrian, Evangelos Bampas, Leszek Gąsieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 33%
Professor 1 17%
Professor > Associate Professor 1 17%
Unknown 2 33%
Readers by discipline Count As %
Computer Science 3 50%
Mathematics 1 17%
Unknown 2 33%