| Description |
1 online resource (xi, 340 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 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 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) |
| 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 |
| 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
|
|
algorithms.
|
|
Informatique.
|
|
Computer algorithms
|
|
Computer networks
|
|
Electronic data processing -- Distributed processing
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Kutten, Shay.
|
|
Žerovnik, Janez.
|
| ISBN |
9783642114762 |
|
3642114768 |
|
