Structural Information and Communication Complexity 15th International Colloquium, SIROCCO 2008 Villars-sur-Ollon, Switzerland, June 17-20, 2008 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Shvartsman, Alexander A. (Επιμελητής έκδοσης), Felber, Pascal (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5058
• Θέματα: Computer science.; Computer communication systems.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Computer Science.; Computer Communication Networks.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Data Structures.

This book constitutes the refereed proceedings of the 15th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2008, held in Villars-sur-Ollon, Switzerland, in June 2008. The 22 revised full papers presented together with 2 invited talks were carefully reviewed a...

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

• Invited Talks
• Mobile Entities Computing: Models and Problems
• Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems
• Regular Papers
• Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
• Locating and Repairing Faults in a Network with Mobile Agents
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
• Distributed Approximation Algorithm for Resource Clustering
• Sharpness: A Tight Condition for Scalability
• Discovery of Network Properties with All-Shortest-Paths Queries
• Recovering the Long-Range Links in Augmented Graphs
• Computing Frequent Elements Using Gossip
• Maintaining Consistent Transactional States without a Global Clock
• Equal-Area Locus-Based Convex Polygon Decomposition
• On the Power of Local Orientations
• Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
• Word of Mouth: Rumor Dissemination in Social Networks
• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• Computing Approximate Nash Equilibria in Network Congestion Games
• On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
• Self-stabilizing Cuts in Synchronous Networks
• Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
• Gathering with Minimum Delay in Tree Sensor Networks
• Centralized Communication in Radio Networks with Strong Interference
• Fast Radio Broadcasting with Advice.