default search action
16. SIROCCO 2009: Piran, Slovenia
- Shay Kutten, Janez Zerovnik:
Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5869, Springer 2010, ISBN 978-3-642-11475-5
Invited Talks
- Israel Cidon:
Zooming in on Network-on-Chip Architectures. 1 - Leszek Gasieniec:
On Efficient Gossiping in Radio Networks. 2-14
Regular Papers
- Roberto Baldoni, Silvia Bonomi, Michel Raynal:
Regular Register: An Implementation in a Churn Prone Environment. 15-29 - Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, Stathis Zachos:
Ordered Coloring Grids and Related Graphs. 30-43 - Hervé Baumann, Pierre Fraigniaud:
Sub-linear Universal Spatial Gossip Protocols. 44-56 - Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado:
Designing Hypergraph Layouts to GMPLS Routing Strategies. 57-71 - Marin Bertier, Yann Busnel, Anne-Marie Kermarrec:
On Gossip and Populations. 72-86 - Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing Visibility Graphs with Simple Robots. 87-99 - Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer:
Stability of Networks in Stretchable Graphs. 100-112 - Shukai Cai, Taisuke Izumi, Koichi Wada:
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. 113-125 - Arnaud Casteigts, Serge Chaumette, Afonso Ferreira:
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. 126-140 - Alain Cournier:
A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm. 141-153 - Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca:
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 154-166 - Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More Efficient Periodic Traversal in Anonymous Undirected Graphs. 167-181 - Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská:
Black Hole Search in Directed Graphs. 182-194 - Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots. 195-208 - Guy Even, Moti Medina:
Revisiting Randomized Parallel Load Balancing Algorithms. 209-221 - Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
An Improved Strategy for Exploring a Grid Polygon. 222-236 - Jean R. S. Blair, Fredrik Manne:
An Efficient Self-stabilizing Distance-2 Coloring Algorithm. 237-251 - Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. 252-265 - Damien Imbs, Michel Raynal:
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition. 266-280 - Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. 281-294 - Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election in Population Protocol Model. 295-308 - Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada:
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. 309-322 - Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). 323-337
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.