Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5869)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: SIROCCO 2009.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (25 papers)
-
Regular Papers
Other volumes
-
Structural Information and Communication Complexity
Keywords
About this book
This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009.
The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization.
Editors and Affiliations
Bibliographic Information
Book Title: Structural Information and Communication Complexity
Book Subtitle: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers
Editors: Shay Kutten, Janez Žerovnik
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-11476-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2010
Softcover ISBN: 978-3-642-11475-5Published: 12 February 2010
eBook ISBN: 978-3-642-11476-2Published: 25 January 2010
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: 350
Number of Illustrations: 75 b/w illustrations
Topics: Programming Techniques, Computer Communication Networks, Discrete Mathematics, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures