Structural Information and Communication Complexity
16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers
(Sprache: Englisch)
a program of such quality. There were two invited speakers: Israel Cidon (the Technion) and Leszek A. Gasieniec (University of Liverpool).
Leider schon ausverkauft
versandkostenfrei
Buch
80.24 €
Produktdetails
Produktinformationen zu „Structural Information and Communication Complexity “
Klappentext zu „Structural Information and Communication Complexity “
a program of such quality. There were two invited speakers: Israel Cidon (the Technion) and Leszek A. Gasieniec (University of Liverpool).
Inhaltsverzeichnis zu „Structural Information and Communication Complexity “
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).
Bibliographische Angaben
- Autoren: Roberto Baldoni , Amotz Bar-Noy , Hervé Baumann , Jean-Claude Bermond , Marin Bertier , Jean Blair
- 2010, 352 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: Janez Zerovnik, Shay Kutten
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 364211475X
- ISBN-13: 9783642114755
- Erscheinungsdatum: 12.02.2010
Sprache:
Englisch
Kommentar zu "Structural Information and Communication Complexity"
0 Gebrauchte Artikel zu „Structural Information and Communication Complexity“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Structural Information and Communication Complexity".
Kommentar verfassen