Structural Information and Communication Complexity 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings /

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully rev...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Scheideler, Christian (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Colección:Theoretical Computer Science and General Issues, 9439
Temas:
Algorithms.
Computer networks .
Computer science-Mathematics.
Discrete mathematics.
Artificial intelligence-Data processing.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Data Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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-Congest Model
  • Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
  • The Computability of Relaxed Data Structures: Queues and Stacks as Examples
  • Comparison-based Interactive Collaborative Filtering
  • Coalescing walks on rotor-router systems.

Ejemplares similares