↓ Skip to main content
What is this page? Embed badge

Distributed Computing

Overview of attention for book
Cover of 'Distributed Computing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Time Complexity Bound for Adaptive Mutual Exclusion
  3. Altmetric Badge
    Chapter 2 Quorum-Based Algorithms for Group Mutual Exclusion
  4. Altmetric Badge
    Chapter 3 An Effective Characterization of Computability in Anonymous Networks
  5. Altmetric Badge
    Chapter 4 Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
  6. Altmetric Badge
    Chapter 5 Optimal Unconditional Information Diffusion
  7. Altmetric Badge
    Chapter 6 Computation Slicing: Techniques and Theory
  8. Altmetric Badge
    Chapter 7 A Low-Latency Non-blocking Commit Service
  9. Altmetric Badge
    Chapter 8 Stable Leader Election
  10. Altmetric Badge
    Chapter 9 Adaptive Long-lived O ( k 2 )-Renaming with O ( k 2 ) Steps
  11. Altmetric Badge
    Chapter 10 A New Synchronous Lower Bound for Set Agreement
  12. Altmetric Badge
    Chapter 11 The Complexity of Synchronous Iterative Do-All with Crashes
  13. Altmetric Badge
    Chapter 12 Mobile Search for a Black Hole in an Anonymous Ring
  14. Altmetric Badge
    Chapter 13 Randomised Mutual Search for k > 2 Agents
  15. Altmetric Badge
    Chapter 14 Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
  16. Altmetric Badge
    Chapter 15 Self Stabilizing Distributed Queuing
  17. Altmetric Badge
    Chapter 16 A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
  18. Altmetric Badge
    Chapter 17 Randomized Finite-state Distributed Algorithms As Markov Chains
  19. Altmetric Badge
    Chapter 18 The Average Hop Count Measure For Virtual Path Layouts
  20. Altmetric Badge
    Chapter 19 Efficient Routing in Networks with Long Range Contacts
  21. Altmetric Badge
    Chapter 20 An Efficient Communication Strategy for Ad-hoc Mobile Networks
  22. Altmetric Badge
    Chapter 21 A Pragmatic Implementation of Non-blocking Linked-lists
  23. Altmetric Badge
    Chapter 22 Stabilizing Replicated Search Trees
  24. Altmetric Badge
    Chapter 23 Adding Networks
Attention for Chapter 6: Computation Slicing: Techniques and Theory
Altmetric Badge

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
5 Mendeley
Summary Dimensions citations
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
Computation Slicing: Techniques and Theory
Chapter number 6
Book title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, October 2001
DOI 10.1007/3-540-45414-4_6
Book ISBNs
978-3-54-042605-9, 978-3-54-045414-4
Authors

Neeraj Mittal, Vijay K. Garg, Mittal, Neeraj, Garg, Vijay K.

View on publisher site
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%
Student > Master 1 20%
Unknown 1 20%
Readers by discipline Count As %
Computer Science 4 80%
Unknown 1 20%

This page is provided by Altmetric.