LEADER 05357nam 22007215 450 001 9910483380003321 005 20230330034139.0 010 $a3-319-03578-9 024 7 $a10.1007/978-3-319-03578-9 035 $a(CKB)3710000000031245 035 $a(DE-He213)978-3-319-03578-9 035 $a(SSID)ssj0001067984 035 $a(PQKBManifestationID)11630117 035 $a(PQKBTitleCode)TC0001067984 035 $a(PQKBWorkID)11093498 035 $a(PQKB)10753113 035 $a(MiAaPQ)EBC3096947 035 $a(PPN)176108149 035 $a(EXLCZ)993710000000031245 100 $a20131108d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aStructural Information and Communication Complexity $e20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers /$fedited by Thomas Moscibroda, Adele A. Rescigno 205 $a1st ed. 2013. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2013. 215 $a1 online resource (XX, 348 p. 53 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8179 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-03577-0 327 $aDistributed Community Detection in Dynamic Graphs -- Exploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8179 606 $aAlgorithms 606 $aComputer networks 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aMoscibroda$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRescigno$b Adele A$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483380003321 996 $aStructural Information and Communication Complexity$92889850 997 $aUNINA