000 04317nam a22005895i 4500
001 978-3-540-32073-9
003 DE-He213
005 20240730184928.0
007 cr nn 008mamaa
008 100714s2005 gw | s |||| 0|eng d
020 _a9783540320739
_9978-3-540-32073-9
024 7 _a10.1007/b136628
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings /
_cedited by Andrzej Pelc, Michel Raynal.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aX, 323 p.
_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 ;
_v3499
505 0 _aCellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry.
520 _aThis book constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005. The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mobile computing, optical computing, and related areas.
650 0 _aComputer networks .
_931572
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aComputer Communication Networks.
_9137249
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
700 1 _aPelc, Andrzej.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9137250
700 1 _aRaynal, Michel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9137251
710 2 _aSpringerLink (Online service)
_9137252
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540260523
776 0 8 _iPrinted edition:
_z9783540811091
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3499
_9137253
856 4 0 _uhttps://doi.org/10.1007/b136628
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92558
_d92558