product iamge

Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009.

The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization.

Author(s): Israel Cidon (auth.), Shay Kutten, Janez Žerovnik (eds.)
Series: Lecture Notes in Computer Science 5869 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 350
Tags: Algorithm Analysis and Problem Complexity; Computer Communication Networks; Discrete Mathematics in Computer Science; Data Structures; Algorithms

Front Matter....Pages -
Zooming in on Network-on-Chip Architectures....Pages 1-1
On Efficient Gossiping in Radio Networks....Pages 2-14
Regular Register: An Implementation in a Churn Prone Environment....Pages 15-29
Ordered Coloring Grids and Related Graphs....Pages 30-43
Sub-linear Universal Spatial Gossip Protocols....Pages 44-56
Designing Hypergraph Layouts to GMPLS Routing Strategies....Pages 57-71
On Gossip and Populations....Pages 72-86
Reconstructing Visibility Graphs with Simple Robots....Pages 87-99
Stability of Networks in Stretchable Graphs....Pages 100-112
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents....Pages 113-125
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks....Pages 126-140
A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm....Pages 141-153
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications....Pages 154-166
More Efficient Periodic Traversal in Anonymous Undirected Graphs....Pages 167-181
Black Hole Search in Directed Graphs....Pages 182-194
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots....Pages 195-208
Revisiting Randomized Parallel Load Balancing Algorithms....Pages 209-221
An Improved Strategy for Exploring a Grid Polygon....Pages 222-236
An Efficient Self-stabilizing Distance-2 Coloring Algorithm....Pages 237-251
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs....Pages 252-265
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition....Pages 266-280
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology....Pages 281-294
Loosely-Stabilizing Leader Election in Population Protocol Model....Pages 295-308
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors....Pages 309-322
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)....Pages 323-337
Back Matter....Pages -