Structural information and communication complexity : 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Proceedings / Guy Even, Magnús M. Halldórsson (eds.).

By: (19th : Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)
Contributor(s): Even, Guy | Magnús M. Halldórsson
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 7355.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2012Description: 1 online resource (xix, 340 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642311048; 3642311040; 3642311032; 9783642311031Other title: SIROCCO 2012Subject(s): Electronic data processing -- Distributed processing -- Congresses | Data structures (Computer science) -- Congresses | Telecommunication systems -- Data processing -- Congresses | Informatique | Data structures (Computer science) | Electronic data processing -- Distributed processing | Telecommunication systems -- Data processing | Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Computational complexity | Algorithms | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer ScienceGenre/Form: Electronic books | Conference papers and proceedings. Additional physical formats: Structural information and communication complexityDDC classification: 004/.36 LOC classification: QA76.9.D5 | C65 2012Other classification: 54.10 Online resources: Click here to access online
Contents:
Space Lower Bounds for Low-Stretch Greedy Embeddings / Ioannis Caragiannis and Christos Kalaitzis -- The Fault Tolerant Capacitated k-Center Problem / Shiri Chechik and David Peleg -- Notions of Connectivity in Overlay Networks / Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg -- Changing of the Guards: Strip Cover with Duty Cycling / Amotz Bar-Noy, Ben Baumer and Dror Rawitz -- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring / Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela -- An Algorithm for Online Facility Leasing / Peter Kling, Friedhelm Meyer auf der Heide and Peter Pietrzyk -- Agreement in Directed Dynamic Networks / Martin Biely, Peter Robinson and Ulrich Schmid -- Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position / Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar -- Strong Connectivity of Sensor Networks with Double Antennae / Mohsen Eftekhari Hesari, Evangelos Kranakis, Fraser MacQuarie, Oscar Morales-Ponce and Lata Narayanan -- Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model / Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau -- Wireless Network Stability in the SINR Model / Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson and Pradipta Mitra -- What Can Be Computed without Communications? / Heger Arfaoui and Pierre Fraigniaud -- On Bidimensional Congestion Games / Vittorio Bilò, Michele Flammini and Vasco Gallotti -- Mobile Network Creation Games / Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli -- Homonyms with Forgeable Identifiers / Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The -- Asynchrony and Collusion in the N-party BAR Transfer Problem / Xavier Vilaça, Oksana Denysyuk and Luís Rodrigues -- Early Deciding Synchronous Renaming in O(logf) Rounds or Less / Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers -- On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract) / Jérémie Chalopin, Yves Métivier and Thomas Morsellino -- Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems / Andreas Larsson and Philippas Tsigas -- Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors / Michel Raynal and Julien Stainer -- Improved Approximation for Orienting Mixed Graphs / Iftah Gamzu and Moti Medina -- Analysis of Random Walks Using Tabu Lists / Karine Altisen, Stéphane Devismes, Antoine Gerbaud and Pascal Lafourcade -- Online Graph Exploration with Advice / Stefan Dobrev, Rastislav Královič and Euripides Markou -- Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles / Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro -- Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization / Samir Elouasbi and Andrzej Pelc -- Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks / Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa -- Getting Close without Touching / Linda Pagli, Giuseppe Prencipe and Giovanni Viglietta -- Gathering of Robots on Anonymous Grids without Multiplicity Detection / Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra.
Summary: This book constitutes the refereed proceedings of the 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Space Lower Bounds for Low-Stretch Greedy Embeddings / Ioannis Caragiannis and Christos Kalaitzis -- The Fault Tolerant Capacitated k-Center Problem / Shiri Chechik and David Peleg -- Notions of Connectivity in Overlay Networks / Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg -- Changing of the Guards: Strip Cover with Duty Cycling / Amotz Bar-Noy, Ben Baumer and Dror Rawitz -- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring / Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela -- An Algorithm for Online Facility Leasing / Peter Kling, Friedhelm Meyer auf der Heide and Peter Pietrzyk -- Agreement in Directed Dynamic Networks / Martin Biely, Peter Robinson and Ulrich Schmid -- Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position / Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar -- Strong Connectivity of Sensor Networks with Double Antennae / Mohsen Eftekhari Hesari, Evangelos Kranakis, Fraser MacQuarie, Oscar Morales-Ponce and Lata Narayanan -- Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model / Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau -- Wireless Network Stability in the SINR Model / Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson and Pradipta Mitra -- What Can Be Computed without Communications? / Heger Arfaoui and Pierre Fraigniaud -- On Bidimensional Congestion Games / Vittorio Bilò, Michele Flammini and Vasco Gallotti -- Mobile Network Creation Games / Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli -- Homonyms with Forgeable Identifiers / Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The -- Asynchrony and Collusion in the N-party BAR Transfer Problem / Xavier Vilaça, Oksana Denysyuk and Luís Rodrigues -- Early Deciding Synchronous Renaming in O(logf) Rounds or Less / Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers -- On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract) / Jérémie Chalopin, Yves Métivier and Thomas Morsellino -- Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems / Andreas Larsson and Philippas Tsigas -- Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors / Michel Raynal and Julien Stainer -- Improved Approximation for Orienting Mixed Graphs / Iftah Gamzu and Moti Medina -- Analysis of Random Walks Using Tabu Lists / Karine Altisen, Stéphane Devismes, Antoine Gerbaud and Pascal Lafourcade -- Online Graph Exploration with Advice / Stefan Dobrev, Rastislav Královič and Euripides Markou -- Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles / Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro -- Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization / Samir Elouasbi and Andrzej Pelc -- Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks / Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa -- Getting Close without Touching / Linda Pagli, Giuseppe Prencipe and Giovanni Viglietta -- Gathering of Robots on Anonymous Grids without Multiplicity Detection / Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra.

International conference proceedings.

Includes bibliographical references and author index.

Online resource; title from PDF title page (SpringerLink, viewed Aug. 10, 2012).

This book constitutes the refereed proceedings of the 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.

There are no comments for this item.

to post a comment.

Powered by Koha