Structural Information and Communication Complexity: 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014, Proceedings - Brossura

Brossura

ISBN 10: 3319096214 ISBN 13: 9783319096216

Casa editrice: Springer, 2014

Riassunto

Invited Presentations.- Algorithmic Aspects of Resource Management in the Cloud.- From Turing to the Clouds (On the Computability Power of Distributed Systems).- Communication Complexity Lower Bounds in Distributed Message-Passing.- Biological Distributed Computing.- Distributed Algorithmic Foundations of Dynamic Networks.- Best Student Paper.- The Beachcombers' Problem: Walking and Searching with Mobile Robots.- Shared Memory and Multiparty Communication.- Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems.- Distributed Transactional Contention Management as the Traveling Salesman Problem.- The complexity gap between consensus and safe-consensus (Extended Abstract).- The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism.- Network Optimization.- Approximation of the Degree-Constrained Minimum Spanning Hierarchies.- Secluded Path via Shortest Path.- CONGEST Algorithms and Lower Bounds.- Distributed Approximation of Minimum Routing Cost Trees.- Randomized Lower Bound for Distributed Spanning-Tree Verification.-Lessons from the Congested Clique Applied to MapReduce.- Wireless networks.- Oblivious Rendezvous in Cognitive Radio Networks.- Local Broadcasting with Arbitrary Transmission Power in the SINR Model.- Aggregation and Creation Games in Networks.- Continuous Aggregation in Dynamic Ad-Hoc Networks.- Network Creation Games with Traceroute-Based Strategies.- Patrolling and Barrier Coverage.-Patrolling by Robots Equipped with Visibility.- Distributed Barrier Coverage with Relocatable Sensors.- Exploration.- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses.- How Many Ants Does It Take To Find the Food?.- What Do We Need to Know to Elect in Networks with Unknown Participants?.- Rendezvous.-Rendezvous of Distance-aware Mobile Agents in Unknown Graphs.- Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks.- Mobile Agents.-Move-optimal partial gathering of mobile agents in asynchronous trees.- A Recursive Approach to Multi-Robot Exploration of Trees.-Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host.

Dettagli dell?edizione

• Editore: Springer
• Data di pubblicazione: 2014
• ISBN 10: 3319096214
• ISBN 13: 9783319096216
• Rilegatura: Paperback
• Lingua: Inglese
• Contatto del produttore: non disponibile