Structural Information and Communication Complexity
Springer International Publishing (Verlag)
978-3-319-25257-5 (ISBN)
This book constitutes the thoroughly refereedpost-conference proceedings of the 22nd International Colloquium on StructuralInformation and Communication Complexity, SIROCCO 2015, held in Montserrat,Spain, in July 2015.
The 30 full papers presented together with 2 invitedpapers were carefully reviewed and selected from 78 submissions. The papersfocus on the study of the interplay between communication and knowledge inmulti-processor systems from both the qualitative and quantitative viewpoints.
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-CongestModel.- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter ofPriority.- The Computability of Relaxed Data Structures: Queues and Stacks as Examples.-Comparison-based Interactive Collaborative Filtering.- Coalescing walks onrotor-router systems.
| Erscheinungsdatum | 30.10.2015 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XI, 476 p. 52 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Applications • approximation algorithms analysis • communication complexity • Communication Networks • Computer Science • conference proceedings • distributed algorithms • Distributed Computing • fault tolerance • Game Theory • Graph Algorithms • graph theory • Informatics • interactive computation • mobile agent • mobile computing • natural algorithms • Parallel Computing • peer-to-peer networks • Research • routing and scheduling • Searching • sensor networks • Social Networks • wireless networks |
| ISBN-10 | 3-319-25257-7 / 3319252577 |
| ISBN-13 | 978-3-319-25257-5 / 9783319252575 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
