↓ 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 Distributed Computing
  3. Altmetric Badge
    Chapter 2 Deterministic Leader Election in $$O(D+\log n)$$ Time with Messages of Size O (1)
  4. Altmetric Badge
    Chapter 3 Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
  5. Altmetric Badge
    Chapter 4 Fast Distributed Algorithms for Testing Graph Properties
  6. Altmetric Badge
    Chapter 5 Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
  7. Altmetric Badge
    Chapter 6 Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
  8. Altmetric Badge
    Chapter 7 Asynchronous Embedded Pattern Formation Without Orientation
  9. Altmetric Badge
    Chapter 8 Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
  10. Altmetric Badge
    Chapter 9 Optimal Consistent Network Updates in Polynomial Time
  11. Altmetric Badge
    Chapter 10 Distributed Construction of Purely Additive Spanners
  12. Altmetric Badge
    Chapter 11 Optimal Fair Computation
  13. Altmetric Badge
    Chapter 12 Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs
  14. Altmetric Badge
    Chapter 13 Anonymity-Preserving Failure Detectors
  15. Altmetric Badge
    Chapter 14 Certified Universal Gathering in $$\mathbb {R} ^2$$ for Oblivious Mobile Robots
  16. Altmetric Badge
    Chapter 15 Non-local Probes Do Not Help with Many Graph Problems
  17. Altmetric Badge
    Chapter 16 Are Byzantine Failures Really Different from Crash Failures?
  18. Altmetric Badge
    Chapter 17 Sublinear-Space Distance Labeling Using Hubs
  19. Altmetric Badge
    Chapter 18 Online Balanced Repartitioning
  20. Altmetric Badge
    Chapter 19 Lower Bound on the Step Complexity of Anonymous Binary Consensus
  21. Altmetric Badge
    Chapter 20 Opacity vs TMS2: Expectations and Reality
  22. Altmetric Badge
    Chapter 21 On Composition and Implementation of Sequential Consistency
  23. Altmetric Badge
    Chapter 22 k-Abortable Objects: Progress Under High Contention
  24. Altmetric Badge
    Chapter 23 Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model
  25. Altmetric Badge
    Chapter 24 Buffer Size for Routing Limited-Rate Adversarial Traffic
  26. Altmetric Badge
    Chapter 25 Distributed Testing of Excluded Subgraphs
  27. Altmetric Badge
    Chapter 26 How to Discreetly Spread a Rumor in a Crowd
  28. Altmetric Badge
    Chapter 27 Depth of a Random Binary Search Tree with Concurrent Insertions
  29. Altmetric Badge
    Chapter 28 Priority Mutual Exclusion: Specification and Algorithm
  30. Altmetric Badge
    Chapter 29 Information Spreading in Dynamic Networks Under Oblivious Adversaries
  31. Altmetric Badge
    Chapter 30 Non-Bayesian Learning in the Presence of Byzantine Agents
  32. Altmetric Badge
    Chapter 31 Asynchronous Computability Theorems for t-Resilient Systems
  33. Altmetric Badge
    Chapter 32 Upper Bounds for Boundless Tagging with Bounded Objects
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
4 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.
Title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, January 2016
DOI 10.1007/978-3-662-53426-7
ISBNs
978-3-66-253425-0, 978-3-66-253426-7
Editors

Cyril Gavoille, David Ilcinkas

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
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 > Master 3 50%
Student > Ph. D. Student 1 17%
Student > Doctoral Student 1 17%
Student > Bachelor 1 17%
Readers by discipline Count As %
Computer Science 5 83%
Engineering 1 17%