000			04493nam a22005295i 4500
001			u374022
003			SIRSI
005			20160812084214.0
007			cr nn 008mamaa
008			100301s2010 gw | s |||| 0|eng d
020			_a9783642114762 _9978-3-642-11476-2
040			_cMX-MeUAM
050		4	_aQA76.9.A43
082	0	4	_a005.1 _223
100	1		_aKutten, Shay. _eeditor.
245	1	0	_aStructural Information and Communication Complexity _h[recurso electrónico] : _b16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers / _cedited by Shay Kutten, Janez Žerovnik.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_a350p. 75 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v5869
505	0		_aInvited Talks -- Zooming in on Network-on-Chip Architectures -- On Efficient Gossiping in Radio Networks -- Regular Papers -- Regular Register: An Implementation in a Churn Prone Environment -- Ordered Coloring Grids and Related Graphs -- Sub-linear Universal Spatial Gossip Protocols -- Designing Hypergraph Layouts to GMPLS Routing Strategies -- On Gossip and Populations -- Reconstructing Visibility Graphs with Simple Robots -- Stability of Networks in Stretchable Graphs -- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents -- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks -- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm -- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications -- More Efficient Periodic Traversal in Anonymous Undirected Graphs -- Black Hole Search in Directed Graphs -- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots -- Revisiting Randomized Parallel Load Balancing Algorithms -- An Improved Strategy for Exploring a Grid Polygon -- An Efficient Self-stabilizing Distance-2 Coloring Algorithm -- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs -- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition -- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology -- Loosely-Stabilizing Leader Election in Population Protocol Model -- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors -- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).
520			_aThis book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aAlgorithms.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aComputer Communication Networks.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aData Structures.
650	2	4	_aAlgorithms.
700	1		_aŽerovnik, Janez. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642114755
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5869
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-11476-2
596			_a19
942			_cLIBRO_ELEC
999			_c201902 _d201902