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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Halldórsson, Magnús M. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2014.
• Σειρά: Lecture Notes in Computer Science, 8576
• Θέματα: Computer science.; Computer communication systems.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Computer Communication Networks.; Discrete Mathematics in Computer Science.; Data Structures.

This book constitutes the refereed proceedings of the 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014, held in Takayama, Japan, in July 2014. The 24  full papers presented  together with 5 invited talks were carefully reviewed and selected from 51 s...

Πίνακας περιεχομένων:

• 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.