↓ 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 Mailbox Problem
  3. Altmetric Badge
    Chapter 2 Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
  4. Altmetric Badge
    Chapter 3 How to Solve Consensus in the Smallest Window of Synchrony
  5. Altmetric Badge
    Chapter 4 Local Terminations and Distributed Computability in Anonymous Networks
  6. Altmetric Badge
    Chapter 5 A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
  7. Altmetric Badge
    Chapter 6 Fast Distributed Approximations in Planar Graphs
  8. Altmetric Badge
    Chapter 7 Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
  9. Altmetric Badge
    Chapter 8 The Weakest Failure Detector for Message Passing Set-Agreement
  10. Altmetric Badge
    Chapter 9 Local Maps: New Insights into Mobile Agent Algorithms
  11. Altmetric Badge
    Chapter 10 r 3 : Resilient Random Regular Graphs
  12. Altmetric Badge
    Chapter 11 Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
  13. Altmetric Badge
    Chapter 12 Constant-Space Localized Byzantine Consensus
  14. Altmetric Badge
    Chapter 13 Optimistic Erasure-Coded Distributed Storage
  15. Altmetric Badge
    Chapter 14 On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
  16. Altmetric Badge
    Chapter 15 On Radio Broadcasting in Random Geometric Graphs
  17. Altmetric Badge
    Chapter 16 Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
  18. Altmetric Badge
    Chapter 17 Deterministic Rendezvous in Trees with Little Memory
  19. Altmetric Badge
    Chapter 18 Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
  20. Altmetric Badge
    Chapter 19 Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
  21. Altmetric Badge
    Chapter 20 On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
  22. Altmetric Badge
    Chapter 21 Permissiveness in Transactional Memories
  23. Altmetric Badge
    Chapter 22 The Synchronization Power of Coalesced Memory Accesses
  24. Altmetric Badge
    Chapter 23 Optimizing Threshold Protocols in Adversarial Structures
  25. Altmetric Badge
    Chapter 24 Hopscotch Hashing
  26. Altmetric Badge
    Chapter 25 Computing Lightweight Spanners Locally
  27. Altmetric Badge
    Chapter 26 Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
  28. Altmetric Badge
    Chapter 27 Leveraging Linial’s Locality Limit
  29. Altmetric Badge
    Chapter 28 Continuous Consensus with Failures and Recoveries
  30. Altmetric Badge
    Chapter 29 No Double Discount: Condition-Based Simultaneity Yields Limited Gain
  31. Altmetric Badge
    Chapter 30 Bosco: One-Step Byzantine Asynchronous Consensus
  32. Altmetric Badge
    Chapter 31 A Limit to the Power of Multiple Nucleation in Self-assembly
  33. Altmetric Badge
    Chapter 32 Using Bounded Model Checking to Verify Consensus Algorithms
  34. Altmetric Badge
    Chapter 33 Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
  35. Altmetric Badge
    Chapter 34 Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
  36. Altmetric Badge
    Chapter 35 The Dynamics of Probabilistic Population Protocols
  37. Altmetric Badge
    Chapter 36 A Distributed Algorithm for Computing and Updating the Process Number of a Forest
  38. Altmetric Badge
    Chapter 37 Brief Announcment: Corruption Resilient Fountain Codes
  39. Altmetric Badge
    Chapter 38 Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
  40. Altmetric Badge
    Chapter 39 Easy Consensus Algorithms for the Crash-Recovery Model
  41. Altmetric Badge
    Chapter 40 Evaluating the Quality of a Network Topology through Random Walks
  42. Altmetric Badge
    Chapter 41 Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems
  43. Altmetric Badge
    Chapter 42 Data Failures
  44. Altmetric Badge
    Chapter 43 Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network
  45. Altmetric Badge
    Chapter 44 Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model
Attention for Chapter 6: Fast Distributed Approximations in Planar Graphs
Altmetric Badge

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
7 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
Fast Distributed Approximations in Planar Graphs
Chapter number 6
Book title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, September 2008
DOI 10.1007/978-3-540-87779-0_6
Book ISBNs
978-3-54-087778-3, 978-3-54-087779-0
Authors

Andrzej Czygrinow, Michal Hańćkowiak, Wojciech Wawrzyniak

Mendeley readers

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

Geographical breakdown

Country Count As %
India 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 29%
Lecturer 1 14%
Student > Postgraduate 1 14%
Professor > Associate Professor 1 14%
Unknown 2 29%
Readers by discipline Count As %
Computer Science 3 43%
Mathematics 1 14%
Agricultural and Biological Sciences 1 14%
Unknown 2 29%