Paola Flocchini
TitleCited byYear
Time-varying graphs and dynamic networks
A Casteigts, P Flocchini, W Quattrociocchi, N Santoro
International Journal of Parallel, Emergent and Distributed Systems 27 (5 …, 2012
6362012
Gathering of asynchronous robots with limited visibility
P Flocchini, G Prencipe, N Santoro, P Widmayer
Theoretical Computer Science 337 (1-3), 147-168, 2005
3312005
Distributed computing by oblivious mobile robots
P Flocchini, G Prencipe, N Santoro
Synthesis lectures on distributed computing theory 3 (2), 1-185, 2012
2282012
Capture of an intruder by mobile agents
L Barrière, P Flocchini, P Fraigniaud, N Santoro
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
2082002
Solving the robots gathering problem
M Cieliebak, P Flocchini, G Prencipe, N Santoro
International Colloquium on Automata, Languages, and Programming, 1181-1196, 2003
2012003
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
P Flocchini, G Prencipe, N Santoro, P Widmayer
Theoretical Computer Science 407 (1-3), 412-447, 2008
1732008
Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots
P Flocchini, G Prencipe, N Santoro, P Widmayer
International Symposium on Algorithms and Computation, 93-102, 1999
1561999
Distributed computing by mobile robots: Gathering
M Cieliebak, P Flocchini, G Prencipe, N Santoro
SIAM Journal on Computing 41 (4), 829-879, 2012
1452012
Mobile search for a black hole in an anonymous ring
S Dobrev, P Flocchini, G Prencipe, N Santoro
Algorithmica 48 (1), 67-90, 2007
139*2007
Gathering of asynchronous oblivious robots with limited visibility
P Flocchini, G Prencipe, N Santoro, P Widmayer
Annual Symposium on Theoretical Aspects of Computer Science, 247-258, 2001
1222001
Computing without communicating: Ring exploration by asynchronous oblivious robots
P Flocchini, D Ilcinkas, A Pelc, N Santoro
Algorithmica 65 (3), 562-583, 2013
116*2013
Time-varying graphs and social network analysis: Temporal indicators and metrics
N Santoro, W Quattrociocchi, P Flocchini, A Casteigts, F Amblard
arXiv preprint arXiv:1102.0629, 2011
1082011
On the exploration of time-varying networks
P Flocchini, B Mans, N Santoro
Theoretical Computer Science 469, 53-68, 2013
99*2013
Cellular automata in fuzzy backgrounds
G Cattaneo, P Flocchini, G Mauri, CQ Vogliotti, N Santoro
Physica D: Nonlinear Phenomena 105 (1-3), 105-120, 1997
941997
On time versus size for monotone dynamic monopolies in regular topologies
P Flocchini, R Královič, P Ružička, A Roncato, N Santoro
Journal of Discrete Algorithms 1 (2), 129-150, 2003
902003
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
E Cáceres, F Dehne, A Ferreira, P Flocchini, I Rieping, A Roncato, ...
International Colloquium on Automata, Languages, and Programming, 390-400, 1997
891997
Multiple mobile agent rendezvous in a ring
P Flocchini, E Kranakis, D Krizanc, N Santoro, C Sawchuk
Latin American Symposium on Theoretical Informatics, 599-608, 2004
882004
Remembering without memory: Tree exploration by asynchronous oblivious robots
P Flocchini, D Ilcinkas, A Pelc, N Santoro
Theoretical Computer Science 411 (14-15), 1583-1598, 2010
832010
Convergence and aperiodicity in fuzzy cellular automata: revisiting rule 90
P Flocchini, F Geurts, A Mingarelli, N Santoro
Physica D: Nonlinear Phenomena 142 (1-2), 20-28, 2000
822000
Searching for a black hole in arbitrary networks: Optimal mobile agents protocols
S Dobrev, P Flocchini, G Prencipe, N Santoro
Distributed Computing 19 (1), 1-99999, 2006
812006
The system can't perform the operation now. Try again later.
Articles 1–20