↓ Skip to main content

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 Zooming in on Network-on-Chip Architectures
  3. Altmetric Badge
    Chapter 2 On Efficient Gossiping in Radio Networks
  4. Altmetric Badge
    Chapter 3 Regular Register: An Implementation in a Churn Prone Environment
  5. Altmetric Badge
    Chapter 4 Ordered Coloring Grids and Related Graphs
  6. Altmetric Badge
    Chapter 5 Sub-linear Universal Spatial Gossip Protocols
  7. Altmetric Badge
    Chapter 6 Designing Hypergraph Layouts to GMPLS Routing Strategies
  8. Altmetric Badge
    Chapter 7 On Gossip and Populations
  9. Altmetric Badge
    Chapter 8 Reconstructing Visibility Graphs with Simple Robots
  10. Altmetric Badge
    Chapter 9 Stability of Networks in Stretchable Graphs
  11. Altmetric Badge
    Chapter 10 Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
  12. Altmetric Badge
    Chapter 11 Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
  13. Altmetric Badge
    Chapter 12 A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm
  14. Altmetric Badge
    Chapter 13 Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
  15. Altmetric Badge
    Chapter 14 Structural Information and Communication Complexity
  16. Altmetric Badge
    Chapter 15 Black Hole Search in Directed Graphs
  17. Altmetric Badge
    Chapter 16 Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
  18. Altmetric Badge
    Chapter 17 Revisiting Randomized Parallel Load Balancing Algorithms
  19. Altmetric Badge
    Chapter 18 An Improved Strategy for Exploring a Grid Polygon
  20. Altmetric Badge
    Chapter 19 An Efficient Self-stabilizing Distance-2 Coloring Algorithm
  21. Altmetric Badge
    Chapter 20 Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
  22. Altmetric Badge
    Chapter 21 A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
  23. Altmetric Badge
    Chapter 22 On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology
  24. Altmetric Badge
    Chapter 23 Loosely-Stabilizing Leader Election in Population Protocol Model
  25. Altmetric Badge
    Chapter 24 Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
  26. Altmetric Badge
    Chapter 25 An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

1 tweeter

Readers on

46 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.
Structural Information and Communication Complexity
Published by
Springer Berlin Heidelberg, January 2010
DOI 10.1007/978-3-642-11476-2
978-3-64-211475-5, 978-3-64-211476-2

Kutten, Shay, Žerovnik, Janez

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 2%
Unknown 45 98%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 4%
Researcher 2 4%
Librarian 1 2%
Professor > Associate Professor 1 2%
Unknown 40 87%
Readers by discipline Count As %
Computer Science 3 7%
Unspecified 1 2%
Chemistry 1 2%
Engineering 1 2%
Unknown 40 87%