LEADER 04547nam 2200625 a 450 001 9910484022803321 005 20200520144314.0 010 $a3-540-69355-6 024 7 $a10.1007/978-3-540-69355-0 035 $a(CKB)1000000000440791 035 $a(SSID)ssj0000320241 035 $a(PQKBManifestationID)11286205 035 $a(PQKBTitleCode)TC0000320241 035 $a(PQKBWorkID)10347442 035 $a(PQKB)10062787 035 $a(DE-He213)978-3-540-69355-0 035 $a(MiAaPQ)EBC3068492 035 $a(PPN)127051732 035 $a(EXLCZ)991000000000440791 100 $a20080507d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStructural information and communication complexity $e15th international colloquium, SIRCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008 : proceedings /$fAlexander A. Shvartsman, Pascal Felber (eds.) 205 $a1st ed. 2008. 210 $aBerlin $cSpringer$d2008 215 $a1 online resource (X, 310 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5058 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-69326-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Mobile Entities Computing: Models and Problems -- Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems -- Regular Papers -- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses -- Locating and Repairing Faults in a Network with Mobile Agents -- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots -- Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory -- Distributed Approximation Algorithm for Resource Clustering -- Sharpness: A Tight Condition for Scalability -- Discovery of Network Properties with All-Shortest-Paths Queries -- Recovering the Long-Range Links in Augmented Graphs -- Computing Frequent Elements Using Gossip -- Maintaining Consistent Transactional States without a Global Clock -- Equal-Area Locus-Based Convex Polygon Decomposition -- On the Power of Local Orientations -- Best Effort and Priority Queuing Policies for Buffered Crossbar Switches -- Word of Mouth: Rumor Dissemination in Social Networks -- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games -- Computing Approximate Nash Equilibria in Network Congestion Games -- On the Performance of Beauquier and Debas? Self-stabilizing Algorithm for Mutual Exclusion -- Self-stabilizing Cuts in Synchronous Networks -- Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs -- Gathering with Minimum Delay in Tree Sensor Networks -- Centralized Communication in Radio Networks with Strong Interference -- Fast Radio Broadcasting with Advice. 330 $aThis book constitutes the refereed proceedings of the 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008, held in Villars-sur-Ollon, Switzerland, in June 2008. The 22 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 52 submissions. The papers cover topics such as distributed algorithms, compact data structures, information dissemination, informative labeling schemes, combinatorial optimization, and others, with potential applications to large scale distributed systems including global computing platforms, peer-to-peer systems and applications, social networks, wireless networks, and network protocols (such as routing, broadcasting, localization). 410 0$aLecture notes in computer science ;$v5058. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aSIROCCO 2008 606 $aElectronic data processing$xDistributed processing$vCongresses 606 $aComputer algorithms$vCongresses 606 $aComputer networks$vCongresses 615 0$aElectronic data processing$xDistributed processing 615 0$aComputer algorithms 615 0$aComputer networks 676 $a004.6 701 $aShvartsman$b Alexander A$01756989 701 $aFelber$b Pascal$01761452 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484022803321 996 $aStructural information and communication complexity$94201960 997 $aUNINA