Vai al contenuto principale della pagina

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.).



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)
Titolo: 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.).
Link to work: Structural information and communication complexity Visualizza cluster
Pubblicazione: Berlin ; New York : Springer, ©2012
Estensione: 1 online resource (xix, 340 pages) : illustrations.
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 004/.36
Titolo uniforme di collana: Lecture notes in computer science 7355. 1611-3349
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Index term-Uncontrolled: Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Soggetto non controllato: Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Termine d'indicizzazione-Occupazione: Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Classificazione: 54.10
Classificazione LOC: QA76.9.D5 C65 2012
Creatori/Collaboratori: Even, Guy.
Magnús M. Halldórsson
Note generali: International conference proceedings.
Contenuto supplementare: Includes bibliographical references and author index.
Nota di contenuto: 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.
Sommario/riassunto: 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.
Collana: Lecture notes in computer science, 1611-3349 ; 7355
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Varianti del titolo: SIROCCO 2012
ISBN: 9783642311048
3642311040
3642311032
9783642311031
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: a9656599
Localizzazioni e accesso elettronico https://stanford.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-642-31104-8
Lo trovi qui: Stanford University
Item: Permalink to OPAC
Altra ed. diverso supporto: Structural information and communication complexity (NL-LeOCL)344053334