Description 
1 online resource (xi, 340 pages) : illustrations 
Series 
Lecture notes in computer science, 03029743 ; 5869 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 5869


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Invited Talks  Zooming in on NetworkonChip Architectures  On Efficient Gossiping in Radio Networks  Regular Papers  Regular Register: An Implementation in a Churn Prone Environment  Ordered Coloring Grids and Related Graphs  Sublinear 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 Selfstabilizing Leader Election in PassivelyMobile Anonymous Agents  Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks  A New Polynomial Silent Stabilizing SpanningTree 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 Semisynchronous Oblivious Robots  Revisiting Randomized Parallel Load Balancing Algorithms  An Improved Strategy for Exploring a Grid Polygon  An Efficient Selfstabilizing Distance2 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  OnLine Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology  LooselyStabilizing Leader Election in Population Protocol Model  Convergence of Mobile Robots with UniformlyInaccurate Sensors  An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) 
Summary 
This book constitutes the thoroughly refereed postconference 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 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Electronic data processing  Distributed processing  Congresses.


Computer algorithms  Congresses.


Computer networks  Congresses.


Algorithms.


Electronic Data Processing.


Computer Communications Networks

Genre/Form 
Conference papers and proceedings.


Congress.


Conference papers and proceedings.

Form 
Electronic book

Author 
Kutten, Shay.


Žerovnik, Janez.

LC no. 
2010920246 
ISBN 
9783642114762 

3642114768 
