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

Structural Information and Communication Complexity

Overview of attention for book
Cover of 'Structural Information and Communication Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Space Lower Bounds for Low-Stretch Greedy Embeddings
  3. Altmetric Badge
    Chapter 2 The Fault Tolerant Capacitated k -Center Problem
  4. Altmetric Badge
    Chapter 3 Notions of Connectivity in Overlay Networks
  5. Altmetric Badge
    Chapter 4 Changing of the Guards: Strip Cover with Duty Cycling
  6. Altmetric Badge
    Chapter 5 Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
  7. Altmetric Badge
    Chapter 6 An Algorithm for Online Facility Leasing
  8. Altmetric Badge
    Chapter 7 Structural Information and Communication Complexity
  9. Altmetric Badge
    Chapter 8 Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position
  10. Altmetric Badge
    Chapter 9 Strong Connectivity of Sensor Networks with Double Antennae
  11. Altmetric Badge
    Chapter 10 Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model
  12. Altmetric Badge
    Chapter 11 Wireless Network Stability in the SINR Model
  13. Altmetric Badge
    Chapter 12 What Can Be Computed without Communications?
  14. Altmetric Badge
    Chapter 13 On Bidimensional Congestion Games
  15. Altmetric Badge
    Chapter 14 Mobile Network Creation Games
  16. Altmetric Badge
    Chapter 15 Homonyms with Forgeable Identifiers
  17. Altmetric Badge
    Chapter 16 Asynchrony and Collusion in the N-party BAR Transfer Problem
  18. Altmetric Badge
    Chapter 17 Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
  19. Altmetric Badge
    Chapter 18 On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
  20. Altmetric Badge
    Chapter 19 Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems
  21. Altmetric Badge
    Chapter 20 Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors
  22. Altmetric Badge
    Chapter 21 Improved Approximation for Orienting Mixed Graphs
  23. Altmetric Badge
    Chapter 22 Analysis of Random Walks Using Tabu Lists
  24. Altmetric Badge
    Chapter 23 Online Graph Exploration with Advice
  25. Altmetric Badge
    Chapter 24 Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O (1) Pebbles
  26. Altmetric Badge
    Chapter 25 Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization
  27. Altmetric Badge
    Chapter 26 Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks
  28. Altmetric Badge
    Chapter 27 Getting Close without Touching
  29. Altmetric Badge
    Chapter 28 Gathering of Robots on Anonymous Grids without Multiplicity Detection
Attention for Chapter 17: Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
Altmetric Badge

Readers on

mendeley
2 Mendeley
Summary
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
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
Chapter number 17
Book title
Structural Information and Communication Complexity
Published by
Springer, Berlin, Heidelberg, June 2012
DOI 10.1007/978-3-642-31104-8_17
Book ISBNs
978-3-64-231103-1, 978-3-64-231104-8
Authors

Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers

View on publisher site

This page is provided by Altmetric.