↓ 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 CBTree: A Practical Concurrent Self-Adjusting Search Tree
  3. Altmetric Badge
    Chapter 2 Efficient Fetch-and-Increment
  4. Altmetric Badge
    Chapter 3 Show No Weakness: Sequentially Consistent Specifications of TSO Libraries
  5. Altmetric Badge
    Chapter 4 Collecting Information by Power-Aware Mobile Agents
  6. Altmetric Badge
    Chapter 5 Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
  7. Altmetric Badge
    Chapter 6 A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation
  8. Altmetric Badge
    Chapter 7 Bounded-Contention Coding for Wireless Networks in the High SNR Regime
  9. Altmetric Badge
    Chapter 8 Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
  10. Altmetric Badge
    Chapter 9 Distributed Online and Stochastic Queuing on a Multiple Access Channel
  11. Altmetric Badge
    Chapter 10 Fast Distributed Computation in Dynamic Networks via Random Walks
  12. Altmetric Badge
    Chapter 11 Dense Subgraphs on Dynamic Networks
  13. Altmetric Badge
    Chapter 12 Distributed Computing
  14. Altmetric Badge
    Chapter 13 No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
  15. Altmetric Badge
    Chapter 14 “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
  16. Altmetric Badge
    Chapter 15 Distributed 2-Approximation Algorithm for the Semi-matching Problem
  17. Altmetric Badge
    Chapter 16 Distributed Computing
  18. Altmetric Badge
    Chapter 17 Efficient Symmetry Breaking in Multi-Channel Radio Networks
  19. Altmetric Badge
    Chapter 18 On Byzantine Broadcast in Loosely Connected Networks
  20. Altmetric Badge
    Chapter 19 RMR-Efficient Randomized Abortable Mutual Exclusion
  21. Altmetric Badge
    Chapter 20 Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
  22. Altmetric Badge
    Chapter 21 Pessimistic Software Lock-Elision
  23. Altmetric Badge
    Chapter 22 Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
  24. Altmetric Badge
    Chapter 23 How to Gather Asynchronous Oblivious Robots on Anonymous Rings
  25. Altmetric Badge
    Chapter 24 Position Discovery for a System of Bouncing Robots
  26. Altmetric Badge
    Chapter 25 Counting-Based Impossibility Proofs for Renaming and Set Agreement
  27. Altmetric Badge
    Chapter 26 Randomized Distributed Decision
  28. Altmetric Badge
    Chapter 27 The Strong At-Most-Once Problem
  29. Altmetric Badge
    Chapter 28 Brief Announcement: Wait-Free Gathering of Mobile Robots
  30. Altmetric Badge
    Chapter 29 Brief Announcement: Distributed Exclusive and Perpetual Tree Searching
  31. Altmetric Badge
    Chapter 30 Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
  32. Altmetric Badge
    Chapter 31 Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model
  33. Altmetric Badge
    Chapter 32 Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
  34. Altmetric Badge
    Chapter 33 Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels
  35. Altmetric Badge
    Chapter 34 Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers
  36. Altmetric Badge
    Chapter 35 Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories
  37. Altmetric Badge
    Chapter 36 Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence
  38. Altmetric Badge
    Chapter 37 Brief Announcement: Node Sampling Using Centrifugal Random Walks
  39. Altmetric Badge
    Chapter 38 Brief Announcement: Concurrent Wait-Free Red-Black Trees
  40. Altmetric Badge
    Chapter 39 Brief Announcement: A Contention-Friendly, Non-blocking Skip List
  41. Altmetric Badge
    Chapter 40 Brief Announcement: Consensus and Efficient Passive Replication
  42. Altmetric Badge
    Chapter 41 Brief Announcement: Anonymity, Failures, Detectors and Consensus
  43. Altmetric Badge
    Chapter 42 Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology?
  44. Altmetric Badge
    Chapter 43 Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams
  45. Altmetric Badge
    Chapter 44 Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems
  46. Altmetric Badge
    Chapter 45 Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems
  47. Altmetric Badge
    Chapter 46 Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks
  48. Altmetric Badge
    Chapter 47 Brief Announcement: SplayNets
  49. Altmetric Badge
    Chapter 48 Brief Announcement: Semantics of Eventually Consistent Replicated Sets
  50. Altmetric Badge
    Chapter 49 Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage
  51. Altmetric Badge
    Chapter 50 Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores
  52. Altmetric Badge
    Chapter 51 Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
1 tweeter

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
9 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 2012
DOI 10.1007/978-3-642-33651-5
ISBNs
978-3-64-233650-8, 978-3-64-233651-5
Editors

Aguilera, Marcos K.

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 11%
Lecturer 1 11%
Unknown 7 78%
Readers by discipline Count As %
Computer Science 1 11%
Engineering 1 11%
Unknown 7 78%