000 03559nam a22006255i 4500
001 978-3-642-13284-1
003 DE-He213
005 20240423125732.0
007 cr nn 008mamaa
008 100605s2010 gw | s |||| 0|eng d
020 _a9783642132841
_9978-3-642-13284-1
024 7 _a10.1007/978-3-642-13284-1
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings /
_cedited by Boaz Patt-Shamir, Tinaz Ekim.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _a273 p. 42 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6058
505 0 _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.
650 0 _aComputer programming.
650 0 _aComputer networks .
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence
_xData processing.
650 1 4 _aProgramming Techniques.
650 2 4 _aComputer Communication Networks.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Science.
700 1 _aPatt-Shamir, Boaz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aEkim, Tinaz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642132834
776 0 8 _iPrinted edition:
_z9783642132858
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6058
856 4 0 _uhttps://doi.org/10.1007/978-3-642-13284-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181152
_d181152