- Cleaning an Arbitrary Regular Network with Mobile Agents
- On the Impact of Sense of Direction on Message Complexity \Lambda
- Electing a leader among anonymous mobile agents in anonymous networks with sense-of-direction
- Solving the Robots Gathering Problem Mark Cieliebak1
- Finding the Extrema of a Distributed Multiset \Lambda
- BACKWARD CONSISTENCY AND SENSE OF DIRECTION IN ADVANCED DISTRIBUTED SYSTEMS \Lambda
- Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols
- International Journal of Foundations of Computer Science fl World Scientific Publishing Company
- Optimal Elections in Labeled Hypercubes \Lambda Paola Flocchini y Bernard Mans z
- Time Optimal Algorithms for Black Hole Search B. Balamohan1
- Black Hole Search in Common Interconnection P. Flocchini
- Can We Elect If We Cannot Compare? Lali Barri
- On Time versus Size for Monotone Dynamic Monopolies in Regular
- Distributed Exploration of Anonymous Graphs by Multiple Agents Shantanu Das
- Network Exploration by Silent and Oblivious Robots
- Theoretical Computer Science 301 (2003) 355379 www.elsevier.com/locate/tcs
- Sense of Direction in Distributed Computing Paola Flocchini
- Algorithmica manuscript No. (will be inserted by the editor)
- On the Relationship between Fuzzy and Boolean Cellular Automata
- IEICE TRANS. ??, VOL.Exx??, NO.xx XXXX 200x Point-of-Failure Swap Rerouting: Computing The Optimal
- Multiple Agents RendezVous In a Ring in Spite of a Black Hole
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Gathering of Asynchronous Robots with Limited Paola Flocchini
- Network Decontamination with Temporal Immunity by Cellular Automata
- Mobile Search for a Black Hole in an Anonymous Ring
- Exploring an Unknown Graph to Locate a Black Hole Using Tokens
- Dynamic Monopolies in Tori \Lambda Paola Flocchini y Elena Lodi z Fabrizio Luccio x
- Automata 2009 On the Relationship between Boolean and
- Capture of an Intruder by Mobile Agents Lali Barri
- Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots
- On the Computational Power of Oblivious Robots: Forming a Series of Geometric Patterns
- EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH
- On the Asymptotic Behaviour of Circular Fuzzy Cellular Automata
- Fault-tolerant sequential scan Paola Flocchini
- Fundamenta Informaticae XXI (2001) 10011018 1001 Radial View of Continuous Cellular Automata
- Measuring Temporal Lags in Delay-Tolerant Networks Arnaud Casteigts, Paola Flocchini, Bernard Mans and Nicola Santoro
- Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
- Exploring trees by teams of asynchronous oblivious robots
- Minimal Sense of Direction in Regular Networks \Lambda
- Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
- Automata 2009 On the Asymptotic Behavior of
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- OPODIS'02, December 11-13, 2002, Reims, France BLACK HOLE SEARCH BY MOBILE AGENTS
- Convergence and Aperiodicity in Fuzzy Cellular Automata: Revisiting Rule 90
- Improved Bounds for Optimal Black Hole Search with a Network Map
- Gathering of Asynchronous Oblivious Robots with Limited Visibility
- Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots
- "JCA" --"JCA-LF(2)" --2008/12/20 --15:27 --page 1 --#1 Journal of Cellular Automata, Vol. 0, pp. 118 2008 Old City Publishing, Inc.
- Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Computing All the Best Swap Edges Distributively P. Flocchini
- Searching for Black Holes in Subways Paola Flocchini Matthew Kellett
- Optimal Irreversible Dynamos in Chordal P. Flocchini
- Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols #
- Self-Deployment of Mobile Sensors on a Ring Paola Flocchini
- Decontamination of Hypercubes by Mobile Agents Paola Flocchini
- Time-Varying Graphs and Dynamic Networks Arnaud Casteigts
