ShopSpell

Structural Information and Communication Complexity: 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceeding [Paperback]

$41.99     $54.99   24% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3319252577
  • ISBN-10:  3319252577
  • ISBN-13:  9783319252575
  • ISBN-13:  9783319252575
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Apr-2015
  • Pub Date:  01-Apr-2015
  • SKU:  3319252577-11-SPRI
  • SKU:  3319252577-11-SPRI
  • Pages:  476
  • Pages:  476
  • Item ID: 106573750
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 15 to Oct 17
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.

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.

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 systel#s
Add Review