Structural Information and Communication Complexity

Structural Information and Communication Complexity

4.11 - 1251 ratings - Source

th These are the proceedings of SIROCCO 2009: the 16 annual Colloquium on Structure, Information, Communication, and Complexity. SIROCCO is devoted tothestudyoftheinterplayandtrade-o?sbetweenthee?ciencyofdecentralized algorithms and systems and the availability of information. Over the years, the colloquium has become a widely recognizedforum, bri- ing together researchers interested in the fundamental principles underlying the interplay between local knowledge and global complexity. It has a tradition of interesting and productive scienti?c meetings in a relaxed and pleasant at- sphere, attracting leading researchers in a variety of ?elds which exhibit such interplay. This means that SIROCCO addresses topics in areas such as distributed computing, parallel computing, game theory, social networks, networking, - bile computing, peer to peer systems, communication complexity, combinatorial optimization, etc. Some of the topics in these areasarecompact data structures, informationdissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, loc- ization, and others. SIROCCO 2009 was held in Piran, Slovenia, on the Adriatic. There were 53 contributions submitted to SIROCCO 2009.The submissions underwent a th- ough refereeing process, where each submission was reviewed by four members of the Program Committee. After in-depth discussions, the Program Comm- tee selected 23 high-quality contributions for presentationat the colloquium and publicationinthisvolume.Separately, fourposterswerealsopresented(butthey arenotincludedintheseproceedings).Wethanktheauthorsofallthesubmitted papers, the Program Committee members, and the external reviewers. Without their dedication, we could not have prepared a program of such quality. There were two invited speakers: Israel Cidon (the Technion) and Leszek A. Gasieniec (University of LiverpoWe first consider the case when u agt; v (in the BFS ordering defining T). We aim at proving that IT^^I alt; |Pa|. For purpose of contradiction, let us assume that \Tv^y\ = \ Ps\ + 1. Let w\ be the child of v in Tv^y. For any 1 alt; i alt; \Ps\ + 1 and let ui be the ianbsp;...

Title:Structural Information and Communication Complexity
Author:Shay Kutten
Publisher:Springer Science & Business Media - 2010-02-12


You Must CONTINUE and create a free account to access unlimited downloads & streaming