An Optimal Bit Complexity Randomised Distributed MIS Algorithm
Métivier Yves, John Michael Robson, Saheb-Djahromi Nasser and Akka Zemmari. |
Distributed computing of efficient routing schemes in generalized chordal graphs
Nicolas Nisse, Ivan Rapaport and Karol Suchan. |
Designing Hypergraph Layouts to GMPLS Routing Strategies
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stephane Perennes, Ignasi Sau and Fernando Solano Donado. |
More efficient periodic traversal in anonymous undirected graphs
Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane and Wing-Kin Sung. |
Loosely-stabilizing Leader Election in Population Protocol Model
Yuichi Sudo, Junya Nakamura, Yukiko Yamauchi, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa. |
Reconstructing Visibility Graphs with Simple Robots
Davide Bilò, Yann Disser, Matus Mihalak, Subhash Suri, Elias Vicari and Peter Widmayer. |
Revisiting Randomized Parallel Load Balancing Algorithms
Guy Even and Moti Medina. |
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka and Koichi Wada. |
Ordered coloring grids and related graphs
Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou and Stathis Zachos. |
Black Hole Search in Directed Graphs
Jurek Czyzowicz, Stefan Dobrev, Rastislav Kralovic, Stanislav Miklík and Dana Pardubská. |
Space Complexity of Self-Stabilizing Leader Election in Passively-Mobile Anonymous Agents
Shukai Cai, Taisuke Izumi and Koichi Wada. |
An Efficient Self-stabilizing Distance-2 Coloring Algorithm
Fredrik Manne and Jean Blair. |
An Improved Strategy for Exploring a Grid Polygon
Agnieszka Kolenderska, Adrian Kosowski, Michał Małafiejski and Paweł Żyliński. |
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
Pierluigi Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi and Paola Vocca. |
A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition
Michel Raynal and Damien Imbs. |
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
Stéphane Devismes, Franck Petit and Sebastien Tixeuil. |
Stability of Networks in Stretchable Graphs
Davide Bilò, Michael Joseph Gatto, Luciano Gualà, Guido Proietti and Peter Widmayer. |
On Gossip and Populations
Marin Bertier, Yann Busnel and Anne-Marie Kermarrec. |
Characterizing topological assumptions of distributed algorithms in dynamic networks
Arnaud Casteigts, Serge Chaumette and Afonso Ferreira. |
On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM problem on a Star Topology
Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks. |
Regular Register: an Implementation in a Churn Prone Environment
Roberto Baldoni, Silvia Bonomi and Michel Raynal. |
Sub-linear Universal Spatial Gossip Protocols
Hervé Baumann and Pierre Fraigniaud. |
A new polynomial silent stabilizing spanning-tree construction algorithm
Alain Cournier. |
