Copyright Notice. The electronic materials in this web pages are presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
JOURNALS
P. Flocchini, D. Ilcinkas, N. Santoro.
Ping pong in dangerous graphs: optimal black hole search with pebbles, Algorithmica 62 (3-4), pag. 1006-1033, 2012.P. Flocchini, T. Mesa, L. Pagli, G. Prencipe, N. Santoro.
Distributed minimum spanning tree maintenance for transient node failures, IEEE Transactions on Computers, 61(3): 408-414, 2012.A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro.
Time-Varying Graphs and Dynamic Networks, International Journal of Parallel, Emergent and Distributed Systems in press.P. Flocchini, M. Kellett, P.C. Mason, N. Santoro.
Searching for Black Holes in Subways, Theory of Computer Systems 50(1), pag. 158-184, 2012.P. Flocchini, D. Ilcinkas, A. Pelc and N. Santoro.
How many oblivious robots can explore a line, Information Processing Letters 111(20):1027-1031, 2011.B. Balamohan, P. Flocchini, A. Miri, N. Santoro.
Time Optimal Algorithms for Black Hole Search in Rings, Discrete Mathematics, Algorithms and Applications, Vol. 3, No. 4, 457-471, 2011H. Betel, P. Flocchini.
On the relationship between fuzzy and Boolean cellular automata, Theoretical Computer Science, 412(8-10): 703-713, 2011.Betel, P. Flocchini.
On the asymptotic behaviour of circular fuzzy cellular automata, Journal of Cellular Automata, 6:1, 25-52, 2011.P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
Remembering without memory: tree exploration by asynchronous oblivious robots, Theoretical Computer Science, 411, 1583-1598, 2010.L. Barriere, P. Flocchini, E. Mesa-Barrameda, N. Santoro.
Uniform scattering of autonomous mobile robots in a grid, International Journal of Foundation of Computer Science, in press.P. Flocchini.
Contamination and decontamination in majority-based systems, Journal of Cellular Automata, 4(3):183-200, 2009.P. Flocchini, A. Pelc, N. Santoro
Fault-tolerant sequential scan. Theory of Computing Systems, 1-26, 2009.P. Flocchini, V. Cezar.
Radial View of Continuous Cellular Automata Fundamenta Informaticae, 87(2): 165-183, 2008.P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer.
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots, Theoretical Computer Science, vol. 407, number 1-3, 412--447, 2008.P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer.
Computing all the best swap edges distributively, Journal of parallel and distributed computing, 68(7): 976-983, 2008.P. Flocchini, M.J. Huang, F.L. Luccio.
Decontamination of hypercubes by mobile agents, Networks, 52(3): 167-178, 2008.P. Flocchini, G. Prencipe, N. Santoro
Self-deployment of mobile sensors on a ring, Theoretical Computer Science, 402(1): 67-80, 2008.S. Das, P. Flocchini, S. Kutten, A. Nayak, N. Santoro.
Map Construction of Unknown Graphs by Multiple Agents, Theoretical Computer Science , 385(1-3): 34-48, 2007.P. Flocchini, F.L. Luccio, M. Huang
Decontamination of chordal rings and tori using mobile agents. International Journal of Foundation of Computer Science, 18(3), 547-564, 2007.H. Becha, P. Flocchini
Optimal construction of sense of direction in a torus by a mobile agent. International Journal of Foundation of Computer Science, 18(3), 529-546, 2007.P. Flocchini, A. Nayak, M. Xie
Enhancing peer-to-peer systems through redundancy. IEEE Journal on Selected Areas in Communications, 25(1), 15-24, 2007.S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
Mobile search for a black hole in an anonymous ring. Algorithmica, 48(1): 67-90, 2007.L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction, Theory of Computing Systems, 40(2), 143-162, 2007.S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols. Distributed Computing, 19(1), 1-19, 2006.S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, N. Santoro
Black hole search in common interconnection networks , Networks , vol 47(2), 61-71, 2006.P. Flocchini, A. Mesa, L. Pagli, G. Prencipe, N. Santoro
Point-of-failures shortest path rerouting: computing the optimal swaps distributively, IEICE Transactions on Information and Systems, vol. E89-D, n. 2, 700-708, 2006.P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer
Gathering of asynchronous mobile robots with limited visibility, Theoretical Computer Science , vol 337: 1-3, 147-168, 2005.P. Flocchini, F.L. Luccio, E. Kranakis, D.Krizanc, N. Santoro
Sorting and election in anonymous asynchronous rings, Journal of Parallel and Distributed Computing , vol. 64:2, 254-265, 2004.P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro
Dynamic Monopolies in Tori, Discrete Applied Mathematics , vol. 137, 197-212, 2004.P. Flocchini, A. Roncato, N. Santoro
Sense of direction and backward consistency in advanced distributed systems , SIAM Journal on Computing , vol. 32:2, 281-306, 2003.P. Flocchini, F.L. Luccio
A New Compact Routing Technique on Series-Parallel Networks, Theory of Computing Systems , vol. 36, 137-157, 2003.P. Flocchini, A. Roncato, N. Santoro
Computing in anonymous networks with sense of direction, Theoretical Computer Science. 301, 355-379, 2003.P. Flocchini, B. Mans, N. Santoro
Sense of direction in distributed computing , Theoretical Computer Science, vol. 291, 29-53, 2003.Flocchini, R. Kralovic, A. Roncato, P. Ruzicka, N. Santoro
On time versus size for monotone dynamic monopolies in regular topologies , Journal of Discrete Algorithms, 135-156, vol. 2 (2), 2002.P. Flocchini, F. Geurts, N. Santoro
Irreversible dynamos in chordal rings , Discrete Applied Mathematics, vol.112, 23-42, 2001.P. Flocchini, F. Geurts, A. Mingarelli, N. Santoro.
Convergence and aperiodicity in fuzzy cellular automata: revisiting rule 90, Physica D, vol. 142, 20-28, 2000.P. Flocchini, A. Roncato, N. Santoro
Symmetries and Sense of Direction in Labeled Graphs Discrete Applied Mathematics, vol. 87, p. 99-115, 1998.P. Flocchini and B. Mans and N. Santoro
Sense of direction: definitions, properties, and classes, Networks, 32(3), p. 165-180, 1998.P. Flocchini, N. Santoro
Topological Constraints for Sense of Direction International Journal of Foundations of Computer Science, 9(2), p. 179-198, 1998.P. Flocchini, B. Mans, N. Santoro.
On the Impact of Sense of Direction on Message Complexity Information Processing Letters, vol. 63, 23-31,1997.P. Flocchini
Minimal Sense of Direction in Regular Networks Information Processing Letters, vol. 61, 331-338, 1997.P. Flocchini, F. Geurts, N. Santoro,
CA-like evolution of a spontaneous overflow error, Parallel Computing, vol. 23, n. 11, 1673-1682, 1997.G.Cattaneo, P.Flocchini, G.Mauri, N.Santoro C. Quaranta Vogliotti,
Cellular automata in fuzzy backgrounds, Physica D, vol. 105, 105-120, 1997.P. Flocchini, B. Mans
Optimal election in labeled hypercubes Journal of Parallel and Distributed Computing, vol. 33, n. 1, 76-83, 1996.P. Alimonti, P. Flocchini, N. Santoro
Finding the Extrema of a Distributed Multiset Journal of Parallel and Distributed Computing, vol.37, 123-133,1996.P. Flocchini, N. Santoro
The chaotic evolution of information in the interaction between knowledge and uncertainty, Complexity International, vol. 2, 1996P. Flocchini, F. Geurts
Searching for chaos in cellular automata: new tools for classification, Complexity International, vol. 2, 1996G.Braga, G. Cattaneo, P. Flocchini C. Quaranta Vogliotti,
Pattern growth in elementary cellular automata, Theoretical Computer Science, vol. 145, 1-26, 1995.G. Braga, G. Cattaneo, P. Flocchini, G. Mauri
Complex chaotic behavior of a class of subshift cellular automata, Complex Systems, vol. 7, 269-296, 1993.
CONFERENCES
S. Das, P. Flocchini, G. Prencipe, N. Santoro, M. Yamashita.
The Power of Lights: Synchronizing Asynchronous Robots using Visible Bits, Proc. 32nd International Conference on Distributed Computing Systems (ICDCS), 2012.P. Flocchini, M. Kellett, P. Mason, N. Santoro.
Finding Good Coffee in Paris, Proc. 6th International Conference on FUN with Algorithms 2012.B. Balamohan, S. Dobrev, P. Flocchini, N. Santoro.
Asynchronous exploration of an unknown anonymous dangerous graph with O(1) pebbles, Proc. 19th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), 2012.A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro.
Time-Varying Graphs and Dynamic Networks. ADHOC-NOW, pag. 346-359, 2011.A. Casteigts, P. Flocchini, B. Mans, N. Santoro.
Measuring temporal lags in delay-tolerant networks 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 209-218, 2011.B. Balamohan, P. Flocchini, A. Miri, N. Santoro.
Improving the Optimal Bounds for Black Hole Search in Rings, Proc. 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 198-209, 2011.F. Amblard, A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro.
On the temporal analysis of scientific network evolution. CASoN, Pag. 169-174, 2011.B. Balamohan, P. Flocchini, A. Miri, N. Santoro.
Time optimal algorithms for black hole search in rings, 4th Int. Conf. on Comb. Optimization and App. (COCOA), pag. 58-71, 2010.S. Das, P. Flocchini, N. Santoro, M. Yamashita.
On the computational power of oblivious robots: forming a series of geometric patterns, 29th ACM Symposium on Principles of Distributed Computing (PODC), 267-276, 2010.Y. Daada, P. Flocchini, N. Zaguja.
Network decontamination with temporal immunity by cellular automata, 9th Int. Conference on Cellular Automata for Research and Industry (ACRI), 287-299, 2010.J. Chalopin, P. Flocchini, B. Mans, N. Santoro.
Network exploration by silent and oblivious robots, 36th Int. Workshop on Graph Theoretic Concepts in Computer Science (WG), 208--216, 2010.A. Casteigts, P. Flocchini, B. Mans, N. Santoro.
Deterministic computations in time-varying graphs: broadcasting under unstructured mobility, 6th IFIP Int. Conference on Theoretical Computer Science, 2010.P. Flocchini, M. Kellett, P. Mason, N. Santoro.
Mapping an unfriendly subway system, 3rd Int. Conference on FUN with Algorithms, 190-201, 2010.P. Flocchini, B. Mans, N. Santoro.
Exploration of Periodically Varying Graphs ISAAC 2009 .P. Flocchini, M. Kellett, P. Mason, N. Santoro.
Map Construction, Spanning Tree Construction, and Election by Scattered Agents in Dangerous Networks IPDPS 2009 .P. Flocchini, D. Ilcinkas, N. Santoro.
Ping pong in dangerous graphs: optimal black hole search with pure tokens DISC 2008 ).P. Flocchini, B. Mans, N. Santoro.
Tree Decontamination with Temporary Immunity, 330-341, ISAAC 2008.P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro
Remembering without memory: tree exploration by asynchronous oblivious robots, extended version of: Proc. Int. Colloquium on Structural Information and Communication Complexity, 33-47, SIROCCO 2008.P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro
Computing without communicating: ring exploration by asynchronous oblivious robots Proc. 11th International Conference On Principles Of Distributed Systems OPODIS 2007.P. Flocchini, X. Ming,
A decentralized solution for locating mobile agents, Proc. Euro-Par 2007.P. Flocchini, T. Mesa Enriquez, L. Pagli, G. Prencipe, N. Santoro,
Distributed computation of all node replacements of a minimum spanning tree, Proc. Euro-Par 2007.S. Das, P. Flocchini,N. Santoro, M. Yamashita.
Fault-tolerant simulation of message-passing algorithms by mobile agents, Proc. of 14th International Colloquium on Structural Information and Communication Complexity , (SIROCCO), 2007.P. Flocchini, A. Nayak, A. Shulz.
Decontamination of arbitrary networks using a team of mobile agents with limited visibility, Proc. IEEE International Conference on Computer & Information Science, 2007.P. Flocchini, N. Santoro.
Distributed security algorithms for mobile agents, Proc. 8th International Conference on Distributed Computing and Networking (ICDCN 2006).S. Das, P. Flocchini, A. Nayak,N. Santoro.
Effective elections for anonymous mobile agents, Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006).P. Flocchini, G. Prencipe, N. Santoro.
Self-Deployment Algorithms for Mobile Sensors on a Ring, Proc. 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks, (ALGOSENSORS 2006).
S. Dobrev, P. Flocchini, R. Kralovic, N. Santoro.
Exploring a dangerous unknown graph using tokens, Proc. of 5th IFIP International Conference on Theoretical Computer Science (TCS 2006).S. Dobrev, P. Flocchini, N. Santoro.
Cycling through a dangerous network: a simple efficient strategy for black hole search, Proc. of 26th International Conference on Distributed Computing Systems (ICDCS 2006).P. Flocchini, M.J. Huang, F.L. Luccio.
Decontamination of chordal rings and tori, Proc. of 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM 2006).H. Becha, P. Flocchini.
Optimal map construction of an unknown torus Proc. of 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM 2006).P. Flocchini, M. J. Huang, F.L. Luccio.
Contiguous search in the hypercube for capturing an intruder, Proc. of 18th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS 2005).
S. Das, P. Flocchini, A. Nayak, N. Santoro.
Distributed exploration of an unknown graph, Proc. of 12th Int. Colloqium on Structural Information and Communication Complexity (SIROCCO 05).P. Flocchini, F.L. Luccio, L. Song.
Size optimal strategies for capturing an intruder in mesh networks, Proc. of International Conference on Communications in Computing (CIC 2005).
P. Flocchini, A. Nayak, A. Schulz.
Cleaning an Arbitrary Regular Network with Mobile Agents , 2nd International Conference on Distributed Computing & Internet Technology (ICDCIT 2005) 132-142.P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer
Computing All the Best Swap Edges Distributively, In Proc. of Symposium on Principles of Distributed Systems (OPODIS 2004).Stefan Dobrev, Paola Flocchini, Nicola Santoro
Improved bounds for optimal black hole search in a network , In Proc. of 11st Int. Symposium on Structural Information and Communication Complexity (SIROCCO 2004)
P. Flocchini, E. Kranakis, D. Krizanc, F.L. Luccio, C. Sawchuk, N. Santoro
Mobile agents rendezvous in a Ring when token fail, In Proc. of 10th Int. Symposium on Structural Information and Communication Complexity (SIROCCO 2004)
P. Flocchini, T. Mesa, L. Pagli, G. Prencipe, N. Santoro
Efficient protocols for computing optimal swap edges, Proc. of IFIP International Conference of Theoretical Computer Science (TCS 2004)
P. Flocchini, E. Kranakis, D. Krizanc, C. Sawchuk, N. Santoro
Mobile agents rendezvous in a Ring, In Proc. of Latin American Theoretical Informatics (LATIN 2004)
S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
Multiple agents rendezvous on a ring in spite of a black hole , In Proc. of Symposium on Principles of Distributed Systems (OPODIS2003).M. Cielibak, P. Flocchini, G. Prencipe, N. Santoro
Solving the robots gathering problem , In Proc. of 30th International Colloquium on Automata, Languages and Programming, (ICALP20003).L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro,
Election and rendezvous in fully anonymous networks with sense of direction, Proc. of 10th International. Colloquium on Structural Information and Communication Complexity (SIROCCO 2003).L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro
Can we elect if we cannot compare ? , Proc. of 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA20003).S. Dobrev,P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, N. Santoro
Optimal search for a black hole in common interconnection networks, Proc. of Symposium on Principles of Distributed Systems (OPODIS 2002), 2002.S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agents Protocols. , Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC 2002),L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro
Capture of an Intruder by Mobile Agents , Proc. of 2002 Symposium on Parallel Algorithms and Architectures (SPAA 2002).S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
Mobile agents searching h for a black hole in anonymous rings , Extended version of Proc. of 15th International Symposium on DIStributed Computing, (DISC 2001), 166-179, 2001P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer
Pattern Formation by Anonymous Robots Without Chirality, Proc. 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), 147-162, 2001.P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer
Gathering of asynchronous mobile robots with limited visibility , Proc. of International Symposium Theoretical Aspects of Computed Science (STACS 2001), Lecture Notes in Computer Science, Vol. 2010, 247-258, Dresden, 2001.P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer,
Distributed coordination of a set of autonomous mobile robots Proc. of IEEE Intelligent Vehicles Symposium (IV 2000), Dearborn, USA, 480-485, 2000.P. Flocchini, E. Kranakis, D. Krizanc, F.L. Luccio, N. Santoro
Sorting multisets in anonymous rings, Proc. International Parallel and Distributed Processing Symposium (IPDPS 2000), Cancun, 275-280, 2000.P. Flocchini, R. Kralovic, A. Roncato, P. Ruzicka, N. Santoro
On time versus size for monotone dynamic monopolies in regular topologies, Proc. 7th Coll. on Structural Information and Communication Complexity (SIROCCO 00), L'Aquila, 111-126, 2000.P. Flocchini, G. Prencipe, N. Santoro,P. Widmayer
Hard tasks for weak robots, Proc. of 10th International Symposium on Algorithm and Computation (ISAAC 99), Chennai, 1999.P. Flocchini, A. Roncato, N. Santoro
Biconsistency and Homonymy in Distributed Systems with Edge Symmetry, Proc. of 3rd International Conf. on Principles of Distributed Systems (OPODIS 99), Hanoi, 29-46, 1999.P. Flocchini, F. Geurts, N. Santoro
Irreversible dynamos in chordal rings, Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 99), Ascona, 1999.P. Flocchini, E. Lodi, F. Luccio, L. Pagli, N. Santoro
Monotone dynamos in Tori, Proc. 6th Colloquium on Structural Information and Communication Complexity (SIROCCO 99), Lacanau, 152-165, 1999.P. Flocchini, A. Roncato, N. Santoro
Sense of Direction and Backward Consistency in Advanced Distributed Systems, Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC 99), Atlanta, 89-98, 1999.G. Bochmann, P. Flocchini, D. Ramazani
Distributed Objects with sense of direction, Proc. Workshop on Distributed Data and Structures, Orlando, 1-15, 1998.P. Flocchini, B. Mans, A. Roncato, N. Santoro
Sense of Direction in Distributed Computing, Proc. of 12th International Symposium on Distributed Computing (DISC 98), Andros, 1-15, 1998.P. Flocchini, B. Mans, A. Roncato, N. Santoro
Levels of sense of direction. Proc. 1st International Conference on Principles of Distributed Systems (OPODIS 97), Chantilly, 319-331, 1997.E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, A.W. Song
Efficient parallel graph algorithms for coarse grained multicomputers and BSP, Proc. of ICALP '97, 390-400, 1997.P. Flocchini, A. Roncato, N. Santoro
Complete symmetries and minimal sense of direction in labeled graphs. Proc. 27th SE Conference on Combinatorics, Graph Theory and Computing, Baton Rouge 1996; in Congressus Numerantium, vol. 121, 3-18, 1996.P. Flocchini, F.L. Luccio
Distance routing on series parallel networks, Proc. 16th IEEE International Conference on Distributed Computing Systems, (ICDCS96) Hong Kong, 352-359, 1996.P. Flocchini, A. Roncato
Computing in anonymous networks with sense of direction, Proc. 3rd Colloquium on Structural Information and Communication Complexity, (SIROCCO 96) 32-46, Siena, 1996.Flocchini, B. Mans, N. Santoro
Sense of direction, associativity, and symmetricity in distributed systems, Proc. 26th SE Conference on Combinatorics, Graph Theory and Computing, Boca Raton, 1995; in Congressus Numerantium, vol 110, 49-63, 1995.P. Flocchini and B. Mans and N. Santoro
Translation properties of sense of direction, Proc. 2nd Colloquium on Structural Information and Communication Complexity, (SIROCCO 95) Olympia, 4-21, 1995.P. Flocchini and N. Santoro
Topological constraints for sense of direction, Proc. 2nd Colloquium on Structural Information and Communication Complexity, (SIROCCO 95) Olympia, 22-37, 1995.P. Flocchini, F. Geurts, N. Santoro
Dynamics and algebraic properties of reinforced shifts, Proc. International Symposium on Nonlinear Theory and Its Applications, Las Vegas, vol. 2, 1149--1152, 1995.G. Cattaneo, P. Flocchini, C. Quaranta-Vogliotti
An effective classification of elementary cellular automata, Proc. National Workshop on Nonlinear Dynamics, vol. 48, 69-78, 1995.P. Flocchini, F. Geurts, N. Santoro
Dynamics and algebraic properties of reinforced shifts, Proc. International Symposium on Nonlinear Theory and Its Applications, Las Vegas, vol. 2, 1149--1152, 1995.P. Flocchini and B. Mans and N. Santoro
Sense of direction: formal definitions and properties, Proc. 1st Colloquium on Structural Information and Communication Complexity, (SIROCCO 94) Ottawa, 9-33, 1994.G. Cattaneo, P. Flocchini, G. Mauri, N. Santoro
A new classification of cellular automata and their algebraic properties, Proc. International Symposium on Nonlinear Theory and Its Applications, Waikiki, 223--226, 1993.