Paola Flocchini

David Ilcinkas

Algorithmica, 2012

Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.

[BibT_eX]

[DOI]

Balasingham Balamohan

Stefan Dobrev

Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: waiting in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

Finding Good Coffee in Paris.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Distributed Algorithms by Forgetful Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Distributed Security Algorithms for Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Mobile Agents in Networking and Distributed Computing, 2012

2011

Computing by Mobile Robotic Sensors.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

On the relationship between fuzzy and Boolean cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the Asymptotic Behaviour of Circular Fuzzy Cellular Automata.

[BibT_eX]

[DOI]

J. Cell. Autom., 2011

How many oblivious robots can explore a line.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Uniform Scattering of Autonomous Mobile Robots in a Grid.

[BibT_eX]

[DOI]

Lali Barrière

Eduardo Mesa Barrameda

Int. J. Found. Comput. Sci., 2011

Time Optimal Algorithms for Black Hole Search in Rings.

[BibT_eX]

[DOI]

Balasingham Balamohan

Ali Miri

Discret. Math. Algorithms Appl., 2011

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics

[BibT_eX]

[DOI]

Walter Quattrociocchi

Arnaud Casteigts

Frédéric Amblard

CoRR, 2011

Improving the Optimal Bounds for Black Hole Search in Rings.

[BibT_eX]

[DOI]

Balasingham Balamohan

Ali Miri

Proceedings of the Structural Information and Communication Complexity, 2011

On the temporal analysis of scientific network evolution.

[BibT_eX]

[DOI]

Frédéric Amblard

Arnaud Casteigts

Walter Quattrociocchi

Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

2010

Remembering without memory: Tree exploration by asynchronous oblivious robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Network Exploration by Silent and Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

On the computational power of oblivious robots: forming a series of geometric patterns.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2010

Mapping an Unfriendly Subway System.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Network Decontamination with Temporal Immunity by Cellular Automata.

[BibT_eX]

[DOI]

Yassine Daadaa

Nejib Zaguia

Proceedings of the Cellular Automata, 2010

2009

Fault-Tolerant Sequential Scan.

[BibT_eX]

[DOI]

Andrzej Pelc

Theory Comput. Syst., 2009

Contamination and Decontamination in Majority-Based Systems.

[BibT_eX]

[DOI]

J. Cell. Autom., 2009

On the Asymptotic Behavior of Fuzzy Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on Cellular Automata and Discrete Complex Systems, 2009

On the Relationship Between Boolean and Fuzzy Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on Cellular Automata and Discrete Complex Systems, 2009

Exploration of Periodically Varying Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Map construction and exploration by mobile agents scattered in a dangerous network.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Self-deployment of mobile sensors on a ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Preface.

[BibT_eX]

[DOI]

Leszek Gasieniec

Theor. Comput. Sci., 2008

Decontamination of hypercubes by mobile agents.

[BibT_eX]

[DOI]

Miao Jun Huang

Networks, 2008

Computing all the best swap edges distributively.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

Radial View of Continuous Cellular Automata.

[BibT_eX]

[DOI]

Vladimir Cezar

Fundam. Informaticae, 2008

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens.

[BibT_eX]

[DOI]

David Ilcinkas

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Tree Decontamination with Temporary Immunity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Map construction of unknown graphs by multiple agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Enhancing peer-to-peer systems through redundancy.

[BibT_eX]

[DOI]

Ming Xie

IEEE J. Sel. Areas Commun., 2007

Decontaminating Chordal Rings and Tori Using Mobile Agents.

[BibT_eX]

[DOI]

Miao Jun Huang

Int. J. Found. Comput. Sci., 2007

Optimal Construction of Sense of Direction in a Torus by a Mobile Agent.

[BibT_eX]

[DOI]

Hanane Becha

Int. J. Found. Comput. Sci., 2007

Mobile Search for a Black Hole in an Anonymous Ring.

[BibT_eX]

[DOI]

Algorithmica, 2007

Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

A Decentralized Solution for Locating Mobile Agents.

[BibT_eX]

[DOI]

Ming Xie

Proceedings of the Euro-Par 2007, 2007

Distributed Computation of All Node Replacements of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility.

[BibT_eX]

[DOI]

Arno Schulz

Proceedings of the 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007

2006

Black hole search in common interconnection networks.

[BibT_eX]

[DOI]

Networks, 2006

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Linda Pagli

IEICE Trans. Inf. Syst., 2006

Searching for a black hole in arbitrary networks: optimal mobile agents protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2006

Effective Elections for Anonymous Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Decontamination of chordal rings and tori.

[BibT_eX]

[DOI]

Miao Jim Huang

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Optimal map construction of an unknown torus.

[BibT_eX]

[DOI]

Hanane Becha

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Exploring an Unknown Graph to Locate a Black Hole Using Tokens.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search.

[BibT_eX]

[DOI]

Stefan Dobrev

Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Distributed Security Algorithms by Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Self-deployment Algorithms for Mobile Sensors on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

Gathering of asynchronous robots with limited visibility.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Distributed Exploration of an Unknown Graph.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Optimal Mobile Agent Algorithms for Finding Size and Orientation of an Unknown Torus.

[BibT_eX]

Hanane Becha

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Contiguous Search in the Hypercube for Capturing an Intruder.

[BibT_eX]

[DOI]

Miao Jun Huang

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Cleaning an Arbitrary Regular Network with Mobile Agents.

[BibT_eX]

[DOI]

Arno Schulz

Proceedings of the Distributed Computing and Internet Technology, 2005

Size Optimal Strategies for Capturing an Intruder in Mesh Networks.

[BibT_eX]

Lisa Xiuli Song

Proceedings of the 2005 International Conference on Communications in Computing, 2005

2004

Sorting and election in anonymous asynchronous rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Dynamic monopolies in tori.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Mobile Agents Rendezvous When Tokens Fail.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Improved Bounds for Optimal Black Hole Search with a Network Map.

[BibT_eX]

[DOI]

Stefan Dobrev

Proceedings of the Structural Information and Communication Complexity, 2004

Computing All the Best Swap Edges Distributively.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Multiple Mobile Agent Rendezvous in a Ring.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.

[BibT_eX]

[DOI]

Antonio Mesa Enriques

Linda Pagli

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Hybrid-Chord: A Peer-to-Peer System Based on Chord.

[BibT_eX]

[DOI]

Ming Xie

Proceedings of the Distributed Computing and Internet Technology, 2004

2003

Computing on anonymous networks with sense of direction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Sense of direction in distributed computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Backward Consistency and Sense of Direction in Advanced Distributed Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Routing in Series Parallel Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

On time versus size for monotone dynamic monopolies in regular topologies.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

Can we elect if we cannot compare?

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Solving the Robots Gathering Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Capture of an intruder by mobile agents.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.

[BibT_eX]

Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

Global roaming management in the next-generation wireless systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2002

2001

Optimal irreversible dynamos in chordal rings.

[BibT_eX]

[DOI]

Frédéric Geurts

Discret. Appl. Math., 2001

Gathering of Asynchronous Oblivious Robots with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Pattern Formation by Anonymous Robots Without Chirality.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

2000

Sorting Multisets in Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

The Dynamics of Distributed Object Naming by Sense of Direction.

[BibT_eX]

Proceedings of the Distributed Data & Structures 2, 1999

Monotone Dynamos in Tori.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

Biconsistency and Homonymy in Distributed Systems with Edge Symmetry.

[BibT_eX]

Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Sense of direction: Definitions, properties, and classes.

[BibT_eX]

[DOI]

Networks, 1998

Topological Constraints for Sense of Direction.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1998

Symmetries and Sense of Direction in Labeled Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Distributed Objects with Sense of Direction.

[BibT_eX]

Gregor von Bochmann

D. Ramazani

Proceedings of the Distributed Data & Structures, 1998

Irreversible Dynamos in Tori.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

CA-Like Error Propagation in Fuzzy CA.

[BibT_eX]

[DOI]

Frédéric Geurts

Parallel Comput., 1997

On the Impact of Sense of Direction on Message Complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Minimal Sense of Direction in Regular Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Levels of Sense of Direction in Distributed Systems.

[BibT_eX]

Proceedings of the On Principles Of Distributed Systems, 1997

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Optimal Elections in Labeled Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Finding the Extrema of a Distributed Multiset.

[BibT_eX]

[DOI]

Paola Alimonti

J. Parallel Distributed Comput., 1996

Computing on Anonymous Networks with Sense of Direction.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

Distance Routing on Series Parallel Networks.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

1995

Pattern Growth in Elementary Cellular Automata.

[BibT_eX]

[DOI]

G. Braga

Gianpiero Cattaneo

C. Quaranta Vogliotti

Theor. Comput. Sci., 1995

Translation Capabilities of Sense of Direction.

[BibT_eX]

Proceedings of the Structure, Information and Communication Complexity, 1995

1994

Sense of Direction: Formal Definitions and Properties.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

Preface.

[BibT_eX]