↓ Skip to main content

Principles of Distributed Systems

Overview of attention for book
Cover of 'Principles of Distributed Systems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 From Energy-Efficient Networking to ZEN
  3. Altmetric Badge
    Chapter 2 Online Regenerator Placement
  4. Altmetric Badge
    Chapter 3 A Quorum-Based Replication Framework for Distributed Software Transactional Memory
  5. Altmetric Badge
    Chapter 4 Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
  6. Altmetric Badge
    Chapter 5 Enhancing the Performance of High Availability Lightweight Live Migration
  7. Altmetric Badge
    Chapter 6 Towards Consistency Oblivious Programming
  8. Altmetric Badge
    Chapter 7 Regret Freedom Isn’t Free
  9. Altmetric Badge
    Chapter 8 On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming
  10. Altmetric Badge
    Chapter 9 On the Cost of Concurrency in Transactional Memory
  11. Altmetric Badge
    Chapter 10 Response Time Bounds for G-EDF without Intra-Task Precedence Constraints
  12. Altmetric Badge
    Chapter 11 Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
  13. Altmetric Badge
    Chapter 12 The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction
  14. Altmetric Badge
    Chapter 13 Anonymous Agreement: The Janus Algorithm
  15. Altmetric Badge
    Chapter 14 Communication Complexity of Consensus in Anonymous Message Passing Systems
  16. Altmetric Badge
    Chapter 15 Non-blocking k -ary Search Trees
  17. Altmetric Badge
    Chapter 16 Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties
  18. Altmetric Badge
    Chapter 17 Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
  19. Altmetric Badge
    Chapter 18 Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction
  20. Altmetric Badge
    Chapter 19 Fused State Machines for Fault Tolerance in Distributed Systems
  21. Altmetric Badge
    Chapter 20 Fork-Consistent Constructions from Registers
  22. Altmetric Badge
    Chapter 21 Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
  23. Altmetric Badge
    Chapter 22 On the Nature of Progress
  24. Altmetric Badge
    Chapter 23 Byzantine Fault-Tolerance with Commutative Commands
  25. Altmetric Badge
    Chapter 24 Partially Non-Preemptive Dual Priority Multiprocessor Scheduling
  26. Altmetric Badge
    Chapter 25 Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy
  27. Altmetric Badge
    Chapter 26 The Impact of Edge Deletions on the Number of Errors in Networks
  28. Altmetric Badge
    Chapter 27 N-party BAR Transfer
  29. Altmetric Badge
    Chapter 28 Computing with Pavlovian Populations
  30. Altmetric Badge
    Chapter 29 Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs
  31. Altmetric Badge
    Chapter 30 Robust Network Supercomputing without Centralized Control
  32. Altmetric Badge
    Chapter 31 On the Power of Waiting When Exploring Public Transportation Systems
  33. Altmetric Badge
    Chapter 32 Accurate Byzantine Agreement with Feedback
  34. Altmetric Badge
    Chapter 33 Constructing Mid-Points for Two-Party Asynchronous Protocols
  35. Altmetric Badge
    Chapter 34 Optimal Instrumentation of Data-flow in Concurrent Data Structures
  36. Altmetric Badge
    Chapter 35 Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
  37. Altmetric Badge
    Chapter 36 Provably Good Scheduling of Sporadic Tasks with Resource Sharing on a Two-Type Heterogeneous Multiprocessor Platform
  38. Altmetric Badge
    Chapter 37 A Dynamic Elimination-Combining Stack Algorithm
Attention for Chapter 25: Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (53rd percentile)

Mentioned by

twitter
2 X users

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
14 Mendeley
citeulike
1 CiteULike
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
Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy
Chapter number 25
Book title
Principles of Distributed Systems
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-25873-2_25
Book ISBNs
978-3-64-225872-5, 978-3-64-225873-2
Authors

Mohammad Alaggan, Sébastien Gambs, Anne-Marie Kermarrec, Alaggan, Mohammad, Gambs, Sébastien, Kermarrec, Anne-Marie

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 14 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Korea, Republic of 1 7%
France 1 7%
Unknown 12 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 29%
Student > Master 4 29%
Professor > Associate Professor 3 21%
Researcher 2 14%
Student > Postgraduate 1 7%
Other 0 0%
Readers by discipline Count As %
Computer Science 12 86%
Mathematics 1 7%
Engineering 1 7%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 11 December 2011.
All research outputs
#16,491,381
of 25,260,058 outputs
Outputs from Lecture notes in computer science
#4,570
of 8,156 outputs
Outputs of similar age
#151,391
of 193,214 outputs
Outputs of similar age from Lecture notes in computer science
#145
of 315 outputs
Altmetric has tracked 25,260,058 research outputs across all sources so far. This one is in the 34th percentile – i.e., 34% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,156 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.2. This one is in the 43rd percentile – i.e., 43% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 193,214 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 21st percentile – i.e., 21% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 315 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 53% of its contemporaries.