Structural Information and Communication Complexity [electronic resource] : 17th International Colloquium, SIROCCO 2010, Şirince, Turkey, June 7-11, 2010. Proceedings / edited by Boaz Patt-Shamir, Tınaz Ekim.
Series: Lecture Notes in Computer Science ; 6058Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: 273 p. 42 illus. online resourceContent type:- text
- computer
- online resource
- 9783642132841
- Computer science
- Computer communication systems
- Computer programming
- Data structures (Computer science)
- Computers
- Algorithms
- Computer science -- Mathematics
- Computer Science
- Programming Techniques
- Computer Communication Networks
- Theory of Computation
- Algorithm Analysis and Problem Complexity
- Discrete Mathematics in Computer Science
- Data Structures
- 005.11 23
- QA76.6-76.66

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.