↓ 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 DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results
  3. Altmetric Badge
    Chapter 2 Fast and Scalable Rendezvousing
  4. Altmetric Badge
    Chapter 3 Beeping a Maximal Independent Set
  5. Altmetric Badge
    Chapter 4 Trading Bit, Message, and Time Complexity of Distributed Algorithms
  6. Altmetric Badge
    Chapter 5 Combinatorial Algorithms for Distributed Graph Coloring
  7. Altmetric Badge
    Chapter 6 Physical Expander in Virtual Tree Overlay
  8. Altmetric Badge
    Chapter 7 Sub-logarithmic Test-and-Set against a Weak Adversary
  9. Altmetric Badge
    Chapter 8 Tight Space Bounds for ℓ-Exclusion
  10. Altmetric Badge
    Chapter 9 SMV: Selective Multi-Versioning STM
  11. Altmetric Badge
    Chapter 10 Brief Announcement: Leaderless Byzantine Paxos
  12. Altmetric Badge
    Chapter 11 Brief Announcement: When You Don’t Trust Clients: Byzantine Proposer Fast Paxos
  13. Altmetric Badge
    Chapter 12 Brief Announcement: On the Meaning of Solving a Task with a Failure Detector
  14. Altmetric Badge
    Chapter 13 Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication
  15. Altmetric Badge
    Chapter 14 Maximum Metric Spanning Tree Made Byzantine Tolerant
  16. Altmetric Badge
    Chapter 15 Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
  17. Altmetric Badge
    Chapter 16 Leakage-Resilient Coin Tossing
  18. Altmetric Badge
    Chapter 17 Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games
  19. Altmetric Badge
    Chapter 18 Brief Announcement: Distributed Approximations for the Semi-matching Problem
  20. Altmetric Badge
    Chapter 19 Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks:
  21. Altmetric Badge
    Chapter 20 Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing
  22. Altmetric Badge
    Chapter 21 DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos
  23. Altmetric Badge
    Chapter 22 Byzantizing Paxos by Refinement
  24. Altmetric Badge
    Chapter 23 Unbounded Contention Resolution in Multiple-Access Channels
  25. Altmetric Badge
    Chapter 24 Deterministic and Energy-Optimal Wireless Synchronization
  26. Altmetric Badge
    Chapter 25 Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast
  27. Altmetric Badge
    Chapter 26 Leader Election Using Loneliness Detection
  28. Altmetric Badge
    Chapter 27 Optimal Random Sampling from Distributed Streams Revisited
  29. Altmetric Badge
    Chapter 28 Parsimonious Flooding in Geometric Random-Walks
  30. Altmetric Badge
    Chapter 29 Misleading Stars: What Cannot Be Measured in the Internet?
  31. Altmetric Badge
    Chapter 30 Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks
  32. Altmetric Badge
    Chapter 31 Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems
  33. Altmetric Badge
    Chapter 32 Brief Announcement: The BG-Simulation for Byzantine Mobile Robots
  34. Altmetric Badge
    Chapter 33 DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots
  35. Altmetric Badge
    Chapter 34 Locality and Checkability in Wait-Free Computing
  36. Altmetric Badge
    Chapter 35 The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
  37. Altmetric Badge
    Chapter 36 Randomized Consensus in Expected O ( n 2 ) Total Work Using Single-Writer Registers
  38. Altmetric Badge
    Chapter 37 Structured Derivation of Semi-Synchronous Algorithms
  39. Altmetric Badge
    Chapter 38 Byzantine Agreement Using Partial Authentication
  40. Altmetric Badge
    Chapter 39 On Approximate Distance Labels and Routing Schemes with Affine Stretch
  41. Altmetric Badge
    Chapter 40 The Complexity of Data Aggregation in Directed Networks
  42. Altmetric Badge
    Chapter 41 Black Hole Search with Finite Automata Scattered in a Synchronous Torus
  43. Altmetric Badge
    Chapter 42 Synchronous Rendezvous for Location-Aware Agents
  44. Altmetric Badge
    Chapter 43 Toward a Formal Semantic Framework for Deterministic Parallel Programming
  45. Altmetric Badge
    Chapter 44 CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention
  46. Altmetric Badge
    Chapter 45 Oblivious Collaboration
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
5 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, October 2011
DOI 10.1007/978-3-642-24100-0
ISBNs
978-3-64-224099-7, 978-3-64-224100-0
Editors

Peleg, David, Peleg, David

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 40%
Student > Doctoral Student 1 20%
Other 1 20%
Student > Bachelor 1 20%
Researcher 1 20%
Other 0 0%
Readers by discipline Count As %
Computer Science 2 40%
Energy 1 20%
Engineering 1 20%
Unknown 1 20%