Structural Information and Communication Complexity

19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers

Editors:

ISBN: 978-3-642-31103-1 (Print) 978-3-642-31104-8 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-12

    Space Lower Bounds for Low-Stretch Greedy Embeddings

  3. No Access

    Book Chapter

    Pages 13-24

    The Fault Tolerant Capacitated k-Center Problem

  4. No Access

    Book Chapter

    Pages 25-35

    Notions of Connectivity in Overlay Networks

  5. No Access

    Book Chapter

    Pages 36-47

    Changing of the Guards: Strip Cover with Duty Cycling

  6. No Access

    Book Chapter

    Pages 48-60

    Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

  7. No Access

    Book Chapter

    Pages 61-72

    An Algorithm for Online Facility Leasing

  8. No Access

    Book Chapter

    Pages 73-84

    Agreement in Directed Dynamic Networks

  9. No Access

    Book Chapter

    Pages 85-98

    Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position

  10. No Access

    Book Chapter

    Pages 99-110

    Strong Connectivity of Sensor Networks with Double Antennae

  11. No Access

    Book Chapter

    Pages 111-122

    Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model

  12. No Access

    Book Chapter

    Pages 123-134

    Wireless Network Stability in the SINR Model

  13. No Access

    Book Chapter

    Pages 135-146

    What Can Be Computed without Communications?

  14. No Access

    Book Chapter

    Pages 147-158

    On Bidimensional Congestion Games

  15. No Access

    Book Chapter

    Pages 159-170

    Mobile Network Creation Games

  16. No Access

    Book Chapter

    Pages 171-182

    Homonyms with Forgeable Identifiers

  17. No Access

    Book Chapter

    Pages 183-194

    Asynchrony and Collusion in the N-party BAR Transfer Problem

  18. No Access

    Book Chapter

    Pages 195-206

    Early Deciding Synchronous Renaming in O( logf ) Rounds or Less

  19. No Access

    Book Chapter

    Pages 207-218

    On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)

  20. No Access

    Book Chapter

    Pages 219-230

    Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems

  21. No Access

    Book Chapter

    Pages 231-242

    Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors

previous Page of 2