TY  - BOOK
AU  - 
AU  - 
ED  - SpringerLink (Online service)
TI  - Structural Information and Communication Complexity: 17th International Colloquium, SIROCCO 2010, ʤirince, Turkey, June 7-11, 2010. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642132841
AV  - Libro electrónico 
U1  - 005.1 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Data structures (Computer science)
KW  - Computer software
KW  - Computational complexity
KW  - Algorithms
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Data Structures
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-13284-1
ER  -