|
|
|
|
| LEADER |
03300nmm a2200349 u 4500 |
| 001 |
EB001086518 |
| 003 |
EBX01000000000000000845882 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
151215 ||| eng |
| 020 |
|
|
|a 9783319252582
|
| 100 |
1 |
|
|a Scheideler, Christian
|e [editor]
|
| 245 |
0 |
0 |
|a Structural Information and Communication Complexity
|h Elektronische Ressource
|b 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings
|c edited by Christian Scheideler
|
| 250 |
|
|
|a 1st ed. 2015
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2015, 2015
|
| 300 |
|
|
|a XI, 476 p. 52 illus
|b online resource
|
| 505 |
0 |
|
|a Communication 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
|
| 653 |
|
|
|a Computer science—Mathematics
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Artificial intelligence—Data processing
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Data Science
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-319-25258-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-25258-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518.1
|
| 520 |
|
|
|a This 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
|