Structural Information and Communication Complexity 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Flocchini, Paola (Editor ), Gasieniec, Leszek (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Theoretical Computer Science and General Issues, 4056
Temas:
Computer networks .
Algorithms.
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:
  • Mobile Agent Rendezvous: A Survey
  • Adapting to Point Contention with Long-Lived Safe Agreement
  • Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?
  • Local Algorithms for Autonomous Robot Systems
  • How to Meet in Anonymous Network
  • Setting Port Numbers for Fast Graph Exploration
  • Distributed Chasing of Network Intruders
  • Election in the Qualitative World
  • Fast Deterministic Distributed Algorithms for Sparse Spanners
  • Efficient Distributed Weighted Matchings on Trees
  • Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs
  • Short Labels by Traversal and Jumping
  • An Optimal Rebuilding Strategy for a Decremental Tree Problem
  • Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering
  • Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures
  • On Fractional Dynamic Faults with Threshold
  • Discovering Network Topology in the Presence of Byzantine Faults
  • Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
  • 3-D Minimum Energy Broadcasting
  • Average-Time Complexity of Gossiping in Radio Networks
  • L(h,1,1)-Labeling of Outerplanar Graphs
  • Combinatorial Algorithms for Compressed Sensing
  • On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
  • Dynamic Asymmetric Communication
  • Approximate Top-k Queries in Sensor Networks
  • Self-stabilizing Space Optimal Synchronization Algorithms on Trees
  • Distance-k Information in Self-stabilizing Algorithms.

Ejemplares similares