000			04167nam a22004935i 4500
003			DE-He213
005			20231104114159.0
007			cr nn 008mamaa
008			151019s2015 gw | s |||| 0|eng d
020			_a9783319252582 _z978-3-319-25258-2
024	7		_a10.1007/978-3-319-25258-2 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
072		7	_aUMB _2thema005.1 _223
245	1	0	_aStructural Information and Communication Complexity : _b22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings / _cedited by Christian Scheideler.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015.
300			_a1 online resource
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	0		_aTheoretical Computer Science and General Issues ; _v9439
505	0		_aCommunication Patterns and Input Patterns in Distributed Computing -- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach -- Node Labels in Local Decision -- Exact bounds for distributed graph colouring -- Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines -- A Randomized Algorithm for Online Scheduling -- Online Admission Control and Embedding of Service Chains -- Optimizing Spread of Inuence in Social Networks via Partial Incentives -- Approximation Algorithms For Multi-Budgeted Network Design Problems -- Simple Distributed + 1 Coloring in the SINR Model -- Nearly Optimal Local Broadcasting in the SINR Model with Feedback -- Byzantine Gathering in Networks -- Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus -- A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees -- A faster computation of all the best swap edges of a tree spanner -- Randomized OBDD-Based Graph Algorithms -- On Fast and Robust Information Spreading in the Vertex-Congest Model -- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority -- The Computability of Relaxed Data Structures: Queues and Stacks as Examples -- Comparison-based Interactive Collaborative Filtering -- Coalescing walks on rotor-router systems.
520			_aThis book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.
650		0	_aComputer software.
650		0	_aComputer Communication Networks.
650		0	_aComputational complexity.
650		0	_aData structures (Computer scienc.
650		0	_aAlgorithms.
650	1	4	_aAlgorithm Analysis and Problem Complexity. _0http://scigraph.springernature.com/things/product-market-codes/I16021
650	2	4	_aComputer Communication Networks. _0http://scigraph.springernature.com/things/product-market-codes/I13022
650	2	4	_aDiscrete Mathematics in Computer Science. _0http://scigraph.springernature.com/things/product-market-codes/I17028
650	2	4	_aData Structures. _0http://scigraph.springernature.com/things/product-market-codes/I15017
650	2	4	_aAlgorithms. _0http://scigraph.springernature.com/things/product-market-codes/M14018
700	1		_aScheideler, Christian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
856	4	0	_uhttps://doi.org/10.1007/978-3-319-25258-2 _3Springer eBooks _zOnline access link to the resource
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c200433660 _d51872
942			_2lcc _cEBK
041			_aeng