↓ 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 On the Computational Complexity of MapReduce
  3. Altmetric Badge
    Chapter 2 Efficient Counting with Optimal Resilience
  4. Altmetric Badge
    Chapter 3 The Computational Power of Beeps
  5. Altmetric Badge
    Chapter 4 Byzantine Fireflies
  6. Altmetric Badge
    Chapter 5 Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability
  7. Altmetric Badge
    Chapter 6 Simulating a Shared Register in an Asynchronous System that Never Stops Changing
  8. Altmetric Badge
    Chapter 7 Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space
  9. Altmetric Badge
    Chapter 8 Anonymous Graph Exploration with Binoculars
  10. Altmetric Badge
    Chapter 9 Limit Behavior of the Multi-agent Rotor-Router System
  11. Altmetric Badge
    Chapter 10 Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution
  12. Altmetric Badge
    Chapter 11 SmartMerge: A New Approach to Reconfiguration for Atomic Storage
  13. Altmetric Badge
    Chapter 12 Towards Automatic Lock Removal for Scalable Synchronization
  14. Altmetric Badge
    Chapter 13 Inherent Limitations of Hybrid Transactional Memory
  15. Altmetric Badge
    Chapter 14 Why Non-blocking Operations Should be Selfish
  16. Altmetric Badge
    Chapter 15 Hybrid Transactional Memory Revisited
  17. Altmetric Badge
    Chapter 16 Grasping the Gap Between Blocking and Non-Blocking Transactional Memories
  18. Altmetric Badge
    Chapter 17 Fast Consensus for Voting on General Expander Graphs
  19. Altmetric Badge
    Chapter 18 Randomness vs. Time in Anonymous Networks
  20. Altmetric Badge
    Chapter 19 Fast Byzantine Leader Election in Dynamic Networks
  21. Altmetric Badge
    Chapter 20 Local Information in Influence Networks
  22. Altmetric Badge
    Chapter 21 Amalgamated Lock-Elision
  23. Altmetric Badge
    Chapter 22 Transactional Interference-Less Balanced Tree
  24. Altmetric Badge
    Chapter 23 Distributed Computing
  25. Altmetric Badge
    Chapter 24 A Constructive Approach for Proving Data Structures’ Linearizability
  26. Altmetric Badge
    Chapter 25 Modular Verification of Concurrency-Aware Linearizability
  27. Altmetric Badge
    Chapter 26 Transaction Chopping for Parallel Snapshot Isolation
  28. Altmetric Badge
    Chapter 27 Computing in Additive Networks with Bounded-Information Codes
  29. Altmetric Badge
    Chapter 28 Specifying Concurrent Problems: Beyond Linearizability and up to Tasks
  30. Altmetric Badge
    Chapter 29 From Geometric Semantics to Asynchronous Computability
  31. Altmetric Badge
    Chapter 30 On the Optimal Space Complexity of Consensus for Anonymous Processes
  32. Altmetric Badge
    Chapter 31 Compressing Communication in Distributed Protocols
  33. Altmetric Badge
    Chapter 32 Privacy-Conscious Information Diffusion in Social Networks
  34. Altmetric Badge
    Chapter 33 Fair Distributed Computation of Reactive Functions
  35. Altmetric Badge
    Chapter 34 Smoothed Analysis of Dynamic Networks
  36. Altmetric Badge
    Chapter 35 Fault Tolerant Reachability for Directed Graphs
  37. Altmetric Badge
    Chapter 36 Locally Optimal Load Balancing
  38. Altmetric Badge
    Chapter 37 Distributed Large Independent Sets in One Round on Bounded-Independence Graphs
  39. Altmetric Badge
    Chapter 38 Tight Bounds for MIS in Multichannel Radio Networks
  40. Altmetric Badge
    Chapter 39 Nonuniform SINR+Voroni Diagrams Are Effectively Uniform
  41. Altmetric Badge
    Chapter 40 Stable Leader Election in Population Protocols Requires Linear Time
  42. Altmetric Badge
    Chapter 41 Distributed Computing
  43. Altmetric Badge
    Chapter 42 Space-Optimal Counting in Population Protocols
Attention for Chapter 1: On the Computational Complexity of MapReduce
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
14 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
On the Computational Complexity of MapReduce
Chapter number 1
Book title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, October 2015
DOI 10.1007/978-3-662-48653-5_1
Book ISBNs
978-3-66-248652-8, 978-3-66-248653-5
Authors

Benjamin Fish, Jeremy Kun, Ádám D. Lelkes, Lev Reyzin, György Turán

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 7%
United States 1 7%
Luxembourg 1 7%
Unknown 11 79%

Demographic breakdown

Readers by professional status Count As %
Researcher 4 29%
Other 4 29%
Student > Bachelor 1 7%
Professor 1 7%
Student > Ph. D. Student 1 7%
Other 1 7%
Unknown 2 14%
Readers by discipline Count As %
Computer Science 7 50%
Mathematics 2 14%
Business, Management and Accounting 1 7%
Engineering 1 7%
Unknown 3 21%