- 2010 Google -Map data 2010 Google -Research Meeting and School on Distributed Computing by Mobile Robots
- TIME-MESSAGE TRADE-OFFS FOR THE WEAK UNISON PROBLEM
- Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP ?
- Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
- Black Hole Search in Asynchronous Rings Using Tokens
- 978-1-4244-5113-5/09/$25.00 c 2009 IEEE Focused-Coverage by Mobile Sensor Networks
- Research Meeting on Distributed Computing by Mobile Robots PROGRAM (TENTATIVE)
- Distributed Security Algorithms for Mobile Agents
- IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 1 A Distributed Algorithm
- Sorting Multisets in Anonymous Rings P. Flocchini
- The International Arab Journal of Information Technology, Vol. 7, No. 2, April 2010 105 Leader Election Algorithm in 2D Torus Networks
- GEOMETRIC CONTAINMENT AND PARTIAL ORDERS School of Computer Science, Carleton University, Ottawa, Ontario, Canada.
- Black Hole Search in Common Interconnection S. Dobrev, P. Flocchini
- Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols
- SENSE OF DIRECTION AND COMMUNICATION COMPLEXITY IN DISTRIBUTED NETWORKS
- On the longest increasing subsequence of a circular list
- Broadcasting on Anonymous Unoriented Tori Stefan Dobrev and Peter Ruzicka
- Distributed Computing in the Presence of Mobile Faults Nicola Santoro
- Mapping an Unfriendly Subway System Paola Flocchini1
- On Fractional Dynamic Faults with Threshold Stefan Dobrev1
- Angle Orders, Regular n-gon Orders Crossing Number of a Partial Order
- FIELDS INSTITUTE Research in Mathematical Sciences www.fields.utoronto.ca
- Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network
- Self-Deployment of Mobile Sensors on a Ring Paola Flocchini
- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
- Scattered Black Hole Search in an Oriented Ring using Tokens Stefan Dobrev, Nicola Santoro, Wei SHI
- Mesh-based Sensor Relocation for Coverage Maintenance in Mobile Sensor Networks
- Effective Elections for Anonymous Mobile Shantanu Das1
- ZONER: A ZONE-based Sensor Relocation Protocol for Mobile Sensor Networks
- Operating R. Stockton Gaines Systems Editor
- Leader Election in Complete Networks Gurdip Singh
- School of Computer Science Carleton University
- Multiple Agents RendezVous In a Ring in Spite of a Black Hole
- Distributed Computing on Oriented Anonymous Hypercubes with Faulty
- Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots
- Information Processing Letters 73 (2000) 199206 An improved testing scheme for catastrophic fault patterns 6
- Efficient Token-Based Control in Rings Esteban Feuerstein
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Remembering without Memory: Tree Exploration
- Localized Distance-sensitive Service Discovery in Wireless Sensor and Actor Networks
- An Integrated Self-Deployment and Coverage Maintenance Scheme for Mobile Sensor
- A distributed algorithm for constructing an Eulerian tour S. A. M. Makki
- Distributed Computation of All Node Replacements of a Minimum Spanning Tree
- THE UN-MERGING PROBLEM Nicola Santoro
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links Jeremie Chalopin
- Tradeoffs in Nonreversing Diameter Hans L. Bodlaender \Lambda Gerard Tel \Lambday
- Exploration of Periodically Varying Graphs Paola Flocchini, Bernard Mans and Nicola Santoro
- Mobile Agent Rendezvous in a Ring Evangelos Kranakis Danny Krizanc y Nicola Santoro Cindy Sawchuk
- Theoretical Computer Science 384 (2007) 232249 www.elsevier.com/locate/tcs
- Linear Broadcasting and N log log N Election in Unoriented Hypercubes ?
- Leader Election In Abelian Cayley Graphs L. BARRI `ERE
- GUESSING GAMES AND DISTRIBUTED COMPUTATIONS IN SYNCHRONOUS NETWORKS
- On Finding Minimum Deadly Sets for Directed Networks Norbert Zeh Nicola Santoro
- Election in arbitrary graphs: simple but not optimal
- Leader Election Observations
- Paola Flocchini Paola Flocchini
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Paola Flocchini Paola Flocchini
- Paola Flocchini Paola Flocchini
- Paola Flocchini Paola Flocchini
- Paola Flocchini Paola Flocchini
- Spanning Tree Construction A spanning tree T of a graph G = (V,E) is an
