Structural Information and Communication Complexity

22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings
Herausgegeben:Scheideler, Christian

• Broschiertes Buch

Produktbeschreibung

This book constitutes the thoroughly refereedpost-conference proceedings of the 22nd International Colloquium on StructuralInformation and Communication Complexity, SIROCCO 2015, held in Montserrat,Spain, in July 2015.

The 30 full papers presented together with 2 invitedpapers were carefully reviewed and selected from 78 submissions. The papersfocus on the study of the interplay between communication and knowledge inmulti-processor systems from both the qualitative and quantitative viewpoints.

Produktdetails

• Theoretical Computer Science and General Issues 9439
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-319-25257-5
• 1st ed. 2015
• Seitenzahl: 488
• Erscheinungstermin: 20. November 2015
• Englisch
• Abmessung: 235mm x 155mm x 27mm
• Gewicht: 733g
• ISBN-13: 9783319252575
• ISBN-10: 3319252577
• Artikelnr.: 43686491

Inhaltsangabe

Communication Patterns and Input Patterns in Distributed Computing.- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach.- Node Labels in Local Decision.- Exact bounds for distributed graph colouring.- Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines.- A Randomized Algorithm for Online Scheduling.- Online Admission Control and Embedding of Service Chains.- Optimizing Spread of Inuence in Social Networks via Partial Incentives.- Approximation Algorithms For Multi-Budgeted Network Design Problems.- Simple Distributed + 1 Coloring in the SINR Model.- Nearly Optimal Local Broadcasting in the SINR Model with Feedback.- Byzantine Gathering in Networks.- Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus.- A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation.- Path-Fault-Tolerant Approximate Shortest-Path Trees.- A faster computation of all the best swap edges of a tree spanner.- Randomized OBDD-Based Graph Algorithms.- On Fast and Robust Information Spreading in the Vertex-CongestModel.- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter ofPriority.- The Computability of Relaxed Data Structures: Queues and Stacks as Examples.-Comparison-based Interactive Collaborative Filtering.- Coalescing walks onrotor-router systems.