Structural Information and Communication Complexity : 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings / edited by Pascal Felber.

Format:

Book

Contributor:

Felber, Pascal, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5058.

Theoretical Computer Science and General Issues ; 5058

Language:

English

Subjects (All):

Computer networks.

Algorithms.

Computer science--Mathematics.

Computer science.

Data structures (Computer science).

Computer Communication Networks.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Local Subjects:

Computer Communication Networks.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Algorithms.

Physical Description:

1 online resource (X, 310 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

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 and selected from 52 submissions. The papers cover topics such as distributed algorithms, compact data structures, information dissemination, informative labeling schemes, combinatorial optimization, and others, with potential applications to large scale distributed systems including global computing platforms, peer-to-peer systems and applications, social networks, wireless networks, and network protocols (such as routing, broadcasting, localization).

Contents:

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.

Other Format:

Printed edition:

ISBN:

978-3-540-69355-0

9783540693550

Access Restriction:

Restricted for use by site license.