Structural Information and Communication Complexity : 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers / edited by Shay Kutten, Janez Žerovnik.

Format:

Book

Contributor:

Kutten, Shay, editor.

Žerovnik, Janez, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

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

Theoretical Computer Science and General Issues ; 5869

Language:

English

Subjects (All):

Computer programming.

Computer networks.

Discrete mathematics.

Algorithms.

Computer science--Mathematics.

Computer science.

Data structures (Computer science).

Programming Techniques.

Computer Communication Networks.

Discrete Mathematics.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Local Subjects:

Programming Techniques.

Computer Communication Networks.

Discrete Mathematics.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Physical Description:

1 online resource (350 pages) : 75 illustrations.

Edition:

First edition 2010.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.

System Details:

text file PDF

Summary:

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.

Contents:

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).

Other Format:

Printed edition:

ISBN:

978-3-642-11476-2

9783642114762

Access Restriction:

Restricted for use by site license.