Structural Information and Communication Complexity [electronic resource] : 17th International Colloquium, SIROCCO 2010, ʤirince, Turkey, June 7-11, 2010. Proceedings / edited by Boaz Patt-Shamir, Tnaz Ekim.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 6058Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: 273p. 42 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642132841Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Discrete Mathematics in Computer Science | Data Structures | AlgorithmsFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1 Clasificación LoC:Libro electrónicoRecursos en línea: de clik aquí para ver el libro electrónico 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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.