000 03669nam a22003855i 4500
001 295146
003 MX-SnUAN
005 20160429155216.0
007 cr nn 008mamaa
008 150903s2005 gw | o |||| 0|eng d
020 _a9783540320739
_99783540320739
024 7 _a10.1007/b136628
_2doi
035 _avtls000348180
039 9 _a201509030204
_bVLOAD
_c201405070504
_dVLOAD
_y201402071021
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aPelc, Andrzej.
_eeditor.
_9325981
245 1 0 _aStructural Information and Communication Complexity :
_b12 International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005. Proceedings /
_cedited by Andrzej Pelc, Michel Raynal.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _ax, 323 páginas Also available online.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3499
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aRaynal, Michel.
_eeditor.
_9299430
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540260523
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b136628
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c295146
_d295146