default search action
20. SIROCCO 2013: Ischia, Italy
- Thomas Moscibroda, Adele A. Rescigno:
Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8179, Springer 2013, ISBN 978-3-319-03577-2
Dynamic Networks Algorithms
- Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). 1-12 - David Ilcinkas, Ahmed Mouhamadou Wade:
Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring. 13-23 - Étienne Coulouma, Emmanuel Godard:
A Characterization of Dynamic Networks Where Consensus Is Solvable. 24-35
Algorithms 1
- Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting Grid Networks to Minimize Expected Path Length. 36-54 - Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. 55-67 - Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares:
Connected Surveillance Game. 68-79
Online Algorithms
- Amir Levi, Boaz Patt-Shamir:
Non-Additive Two-Option Ski Rental. 80-91 - Marcin Bienkowski, Stefan Schmid:
Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie. 92-103 - Guy Even, Moti Medina:
A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations. 104-115
Social Networks Systems
- Nidhi Hegde, Laurent Massoulié, Laurent Viennot:
Self-organizing Flows in Social Networks. 116-128 - Hugues Mercier, Emanuel Onica, Etienne Rivière, Pascal Felber:
Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters. 129-140 - Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. 141-152
Distributed Algorithms
- Yves Métivier, John Michael Robson, Akka Zemmari:
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). 153-164 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. 165-176 - Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining Balanced Trees for Structured Distributed Streaming Systems. 177-188
Robots
- Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Rendezvous of Two Robots with Constant Memory. 189-200 - Yukiko Yamauchi, Masafumi Yamashita:
Pattern Formation by Mobile Robots with Limited Visibility. 201-212 - Gabriele Di Stefano, Alfredo Navarra:
Optimal Gathering of Oblivious Robots in Anonymous Graphs. 213-224
Wireless Networks
- Hadassa Daltrophe, Shlomi Dolev, Zvi Lotker:
Probabilistic Connectivity Threshold for Directional Antenna Widths - (Extended Abstract). 225-236 - Lakshmi Anantharamu, Bogdan S. Chlebus:
Broadcasting in Ad Hoc Multiple Access Channels. 237-248 - Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Profit Maximization in Flex-Grid All-Optical Networks. 249-260
Algorithms 2
- Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou:
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies. 261-273 - Jun Kawahara, Koji M. Kobayashi:
Optimal Buffer Management for 2-Frame Throughput Maximization. 274-285 - Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Dynamically Maintaining Shortest Path Trees under Batches of Updates. 286-297
Algorithms 3
- Michel Raynal, Julien Stainer:
Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems. 298-309 - Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Steiner Problems with Limited Number of Branching Nodes. 310-321 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. 322-333 - Christian Schindelhauer, Christian Ortolf:
Maximum Distance Separable Codes Based on Circulant Cauchy Matrices. 334-345
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.