Structural Information and Communication Complexity 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Patt-Shamir, Boaz (Editor ), Ekim, Tinaz (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Theoretical Computer Science and General Issues, 6058
Temas:
Computer programming.
Computer networks .
Computer science.
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Artificial intelligence-Data processing.
Programming Techniques.
Computer Communication Networks.
Theory of Computation.
Discrete Mathematics in Computer Science.
Data Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Communication Complexity: From Two-Party to Multiparty
  • On the Impact of Local Taxes in a Set Cover Game
  • Towards Network Games with Social Preferences
  • Distributed Weighted Stable Marriage Problem
  • Traffic Grooming in Star Networks via Matching Techniques
  • Event Extent Estimation
  • Asynchronous Deterministic Rendezvous in Bounded Terrains
  • Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
  • Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
  • Average Long-Lived Memoryless Consensus: The Three-Value Case
  • Algorithms for Extracting Timeliness Graphs
  • Distributed Tree Comparison with Nodes of Limited Memory
  • Periodic Data Retrieval Problem in Rings Containing a Malicious Host
  • A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
  • Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
  • Maximum Interference of Random Sensors on a Line
  • Multipath Spanners
  • Strong Orientations of Planar Graphs with Bounded Stretch Factor
  • A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
  • Fast Algorithms for min independent dominating set.

Ejemplares similares