Structural Information and Communication Complexity: 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010, Proceedings (Computer Science and General Issues): 6058 - Brossura

Brossura

ISBN 10: 3642132839 ISBN 13: 9783642132834

Casa editrice: Springer, 2010

Riassunto

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.

The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes

-proceedings (published in time for the respective conference)

-post-proceedings (consisting of thoroughly revised final full papers)

-research monographs (which may be based on outstanding PhD work, research projects, technical reports, etc.)

More recently, several color-cover sublines have been added featuring, beyond a collection of papers, various added-value components; these sublines include

-tutorials (textbook-like monographs or collections of lectures given at advanced courses)

-state-of-the-art surveys (offering complete and mediated coverage of a topic)

-hot topics (introducing emergent topics to the broader community)

Su questo libro

Contenuti

Communication Complexity: From Two-Party to Multiparty.- On the Impact of Local Taxes in a Set Cover Game.- Towards Network Games with Social Preferences.- Distributed Weighted Stable Marriage Problem.- Traffic Grooming in Star Networks via Matching Techniques.- Event Extent Estimation.- Asynchronous Deterministic Rendezvous in Bounded Terrains.- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees.- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings.- Average Long-Lived Memoryless Consensus: The Three-Value Case.- Algorithms for Extracting Timeliness Graphs.- Distributed Tree Comparison with Nodes of Limited Memory.- Periodic Data Retrieval Problem in Rings Containing a Malicious Host.- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots.- Maximum Interference of Random Sensors on a Line.- Multipath Spanners.- Strong Orientations of Planar Graphs with Bounded Stretch Factor.- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs.- Fast Algorithms for min independent dominating set.

Dettagli dell?edizione

• Editore: Springer
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 3642132839
• ISBN 13: 9783642132834
• Rilegatura: Copertina flessibile
• Numero di pagine: 276
• Redattore: Patt-Shamir Boaz
• Contatto del produttore: {language_tag:it_IT,value:"Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com"}