Structural Information and Communication Complexity

Invited Talks.- Zooming in on Network-on-Chip Architectures.- On Efficient Gossiping in Radio Networks.- Regular Papers.- Regular Register: An Implementation in a Churn Prone Environment.- Ordered Coloring Grids and Related Graphs.- Sub-linear Universal Spatial Gossip Protocols.- Designing Hypergraph Layouts to GMPLS Routing Strategies.- On Gossip and Populations.- Reconstructing Visibility Graphs with Simple Robots.- Stability of Networks in Stretchable Graphs.- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents.- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks.- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm.- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.- More Efficient Periodic Traversal in Anonymous Undirected Graphs.- Black Hole Search in Directed Graphs.- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots.- Revisiting Randomized Parallel Load Balancing Algorithms.- An Improved Strategy for Exploring a Grid Polygon.- An Efficient Self-stabilizing Distance-2 Coloring Algorithm.- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs.- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition.- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.- Loosely-Stabilizing Leader Election in Population Protocol Model.- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors.- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).