LEADER 04149nam  22008175  450 
001 996465590603316
005 20230220233444.0
010   $a1-280-38677-0
010   $a9786613564696
010   $a3-642-13284-7
024 7 $a10.1007/978-3-642-13284-1
035   $a(CKB)2670000000028978
035   $a(SSID)ssj0000446806
035   $a(PQKBManifestationID)11314931
035   $a(PQKBTitleCode)TC0000446806
035   $a(PQKBWorkID)10505184
035   $a(PQKB)11355184
035   $a(DE-He213)978-3-642-13284-1
035   $a(MiAaPQ)EBC3065352
035   $a(PPN)149063539
035   $a(EXLCZ)992670000000028978
100   $a20100605d2010      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aStructural Information and Communication Complexity$b[electronic resource] $e17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings /$fedited by Boaz Patt-Shamir, Tinaz Ekim
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (273 p. 42 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6058
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-13283-9 
320   $aIncludes bibliographical references and index.
327   $aCommunication 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6058
606   $aComputer programming
606   $aComputer networks
606   $aComputer science
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence?Data processing
606   $aProgramming Techniques
606   $aComputer Communication Networks
606   $aTheory of Computation
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aData Science
615  0$aComputer programming.
615  0$aComputer networks.
615  0$aComputer science.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence?Data processing.
615 14$aProgramming Techniques.
615 24$aComputer Communication Networks.
615 24$aTheory of Computation.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Science.
676   $a004.6
702   $aPatt-Shamir$b Boaz$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aEkim$b Tinaz$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aColloquium on Structural Information and Communication Complexity
906   $aBOOK
912   $a996465590603316
996   $aStructural Information and Communication Complexity$92889850
997   $aUNISA