Structural Information and Communication Complexity

22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings

AvChristian Scheideler

Häftad, Engelska, 2015

Del 9439 i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2015-11-20
Mått:155 x 235 x 27 mm
Vikt:733 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:476
Upplaga:15001
Förlag:Springer International Publishing AG
ISBN:9783319252575

Utforska kategorier

Innehållsförteckning

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.

Du kanske också är intresserad av

Structural Information and Communication Complexity

Christian Scheideler

E-bok

2015

718 kr

Del 12156

Structural Information and Communication Complexity

Andrea Werneck Richa, Christian Scheideler

Häftad, 2020

572 kr

Taschenbuch der Algorithmen

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

Häftad, 2008

483 kr

Distributed Computing in Sensor Systems

Samuel Madden, Anish Arora, Christian Scheideler, James Aspnes

E-bok

2007

718 kr

Algorithms Unplugged

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

Häftad, 2016

1 214 kr

Algorithms for Sensor Systems

Christian Scheideler, Falko Dressler

E-bok

2019

739 kr

Stabilization, Safety, and Security of Distributed Systems

Christian Scheideler, Andrea W. Richa

E-bok

2012

739 kr

Taschenbuch der Algorithmen

Dorothea Wagner, Heribert Vollmer, Christian Scheideler, Rudiger Reischuk, Martin Dietzfelbinger, Helmut Alt, Berthold Vocking

E-bok

2008

493 kr

Stabilization, Safety, and Security of Distributed Systems

Andréa W. Richa, Christian Scheideler

Häftad, 2012

572 kr

Universal Routing Strategies for Interconnection Networks

Christian Scheideler

Häftad, 1998

572 kr

Structural Information and Communication Complexity

22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings

AvChristian Scheideler

Häftad, Engelska, 2015

Del 9439 i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2015-11-20
Mått:155 x 235 x 27 mm
Vikt:733 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:476
Upplaga:15001
Förlag:Springer International Publishing AG
ISBN:9783319252575

Utforska kategorier

Innehållsförteckning

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.