000 03428nam a22003615i 4500
001 vtls001948747
003 NLI
005 20210630062833.0
007 cr nn 008mamaa
008 170529s2013 gw | s |||| 0|eng d
020 _a9783319035789
_9978-3-319-03578-9
039 9 _y201705291607
_zgopag
041 0 _aeng
044 _agw
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers /
_cedited by Thomas Moscibroda, Adele A. Rescigno.
260 _aCham :
_bSpringer International Publishing,
_c2013.
300 _a1 online resource (XX, 348 p. 53 ill.)
440 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8179
_9833933
505 0 _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.
650 0 _aComputer science.
650 0 _aComputer communication systems.
_91048049
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
_9783689
650 0 _aComputer science
_xMathematics.
_9893690
700 1 _aMoscibroda, Thomas,
_4edt
_91306628
700 1 _aRescigno, Adele A,
_4edt
_91306629
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-03578-9
887 _a Gopa
905 _aGopa
949 _AVIRTUAITEM
_D10000
_X206
_6EBK000023782ENG
_eEBK23782
942 _2ddc
_cBKS
999 _aVIRTUA
_c1372607
_d1372607
999 _aVTLSSORT0070*0080*0200*0410*0440*2450*2600*3000*4400*5050*6500*6501*6502*6503*6504*7000*7001*8560*9050*9992