04149nam 22008175 450 99646559060331620230220233444.01-280-38677-097866135646963-642-13284-710.1007/978-3-642-13284-1(CKB)2670000000028978(SSID)ssj0000446806(PQKBManifestationID)11314931(PQKBTitleCode)TC0000446806(PQKBWorkID)10505184(PQKB)11355184(DE-He213)978-3-642-13284-1(MiAaPQ)EBC3065352(PPN)149063539(EXLCZ)99267000000002897820100605d2010 u| 0engurnn|008mamaatxtccrStructural Information and Communication Complexity[electronic resource] 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings /edited by Boaz Patt-Shamir, Tinaz Ekim1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (273 p. 42 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6058Bibliographic Level Mode of Issuance: Monograph3-642-13283-9 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;6058Computer programmingComputer networksComputer scienceAlgorithmsComputer science—MathematicsDiscrete mathematicsArtificial intelligence—Data processingProgramming TechniquesComputer Communication NetworksTheory of ComputationAlgorithmsDiscrete Mathematics in Computer ScienceData ScienceComputer programming.Computer networks.Computer science.Algorithms.Computer science—Mathematics.Discrete mathematics.Artificial intelligence—Data processing.Programming Techniques.Computer Communication Networks.Theory of Computation.Algorithms.Discrete Mathematics in Computer Science.Data Science.004.6Patt-Shamir Boazedthttp://id.loc.gov/vocabulary/relators/edtEkim Tinazedthttp://id.loc.gov/vocabulary/relators/edtColloquium on Structural Information and Communication ComplexityBOOK996465590603316Structural Information and Communication Complexity2889850UNISA