Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected P by Shay KuttenStructural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected P by Shay Kutten

Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009…

byShay KuttenEditorJanez Žerovnik

Paperback | February 12, 2010

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

LNCS 5869
Title:Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009…Format:PaperbackDimensions:350 pages, 23.5 × 15.5 × 0.01 inPublished:February 12, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:364211475X

ISBN - 13:9783642114755

Look for similar items by category:

Reviews

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