[copyright notice]

 

Books

  1. P. Flocchini, G. Prencipe and N. Santoro. Distributed Computing by Oblivious Mobile Robots Morgan & Claypool Publishers, 2012.

 

Editor (.pdf)

  1. G. Prencipe, C. Zavattari, A. Tommasi and J. Favaro. Special Issue on Algorithms and Today's Practitioner, IEEE SOFTWARE.. Volume 29, pp. 61--83, 2012.
  2. G. Prencipe and S. Zaks. Special Issue on Theoretical Computer Science. Volume 410, Issue 14, pp. 1305-1412, March 2009.
  3. G. Prencipe and S. Zaks. Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO 2007), LNCS 4474. Castiglioncello, Italy, 5-8 June 2007.
  4. P. Crescenzi, G. prencipe and G. Pucci. Proceedings of the 4th International Conference on FUN With Algorithms (FUN 2007), LNCS 4475. Castiglioncello, Italy, 3-5 June 2007.
  5. J. Anderson, G. Prencipe and R. Wattenhofer. Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005), LNCS 3974. Pisa, Italy, 12-14 December 2005.

 

Journals and Books' Chapters(.pdf)

  1. M. Cieliebak, P. Flocchini, G. Prencipe and N. Santoro. Distributed Computing by Mobile Robots: Gathering. SIAM J. on Computing, Vol. 41(4), pp. 829–879, 2012.
  2. G. Prencipe, C. Zavattari, A. Tommasi and J. Favaro. Special Issue on Algorithms and Today's Practitioner, IEEE SOFTWARE, Volume 29, pp. 61--63, 2012.
  3. P. Flocchini, T. M. Enriquez, L. Pagli, G. Prencipe and N. Santoro. Distributed Minimum Spanning Tree Maintenance for Transient Node Failures. IEEE Transactions on Computers, vol. 61, p. 408-414, 2012.
  4. P. Flocchini, G. Prencipe and N. Santoro. Computing by Mobile Robotic Sensors. in Theoretical Aspects of Distributed Computing in Sensor Networks (Monographs in Theoretical Computer Science), pp. 655--693,Springer, 2011.
  5. P. Flocchini, G. Prencipe and N. Santoro and P. Widmayer. Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots. Theoretical Computer Science, 407:412-447, 2008.
  6. P. Flocchini, G. Prencipe, N. Santoro and P. Widmayer. Computing All The Best Swap Edges Distributively. Journal of Parallel and Distributing Computing (JPDC), Vol. 68(7), pag. 976-983, 2008.
  7. P. Flocchini, G. Prencipe and N. Santoro. Self-Deployment of Mobile Sensor Networks on a Ring. Theoretical Computer Science (TCS), Vol. 402, pag. 67-80, 2008.
  8. G. Prencipe. Impossibility of Gathering by a Set of Autonomous Mobile Robots. Theoretical Computer Science (TCS), Vol. 384(2-3), pag. 222-231, 2007.
  9. S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro. Mobile Search for a Black Hole in an Anonymous Ring. Algorithmica, 48:67-90, 2007.
  10. S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro. Searching For a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols. Distributed Computing, Vol. 19(1), pag. 1-18, 2006.
  11. P. Flocchini, A. M. Enriques, L. Pagli, G. Prencipe and N. Santoro. Point-of-Failure Swap Rerouting: Computing The Optimal Swaps Distributively. IEICE Transactions on Information and Systems, Vol. E89-D N. 2, Febbraio 2006.
  12. S. Dobrev, P. Flocchini, R. Královič, P. Ružička, G. Prencipe, and N. Santoro. Black Hole Search in Common Interconnection Networks. Networks, Vol. 47, Issue 2, 2006, pag. 61--71.
  13. G. Prencipe. The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots. Theory Of Computing Systems (TOCS), Vol. 38, 2005, pag. 539--558.
  14. P. Flocchini, G. Prencipe, N. Santoro and P. Widmayer. Gathering of Asynchronous Robots with Limited Visibility. Theoretical Computer Science (TCS), Vol. 337, 2005, pag. 147--168.
  15. V. Gervasi, and G. Prencipe. Coordination Without Communication: The Case of The Flocking Problem. Discrete Applied Mathematics, Vol 143, 2004, pag. 203--223.
  16. P. Flocchini, G.Prencipe, N. Santoro, and P. Widmayer. Pattern Formation by Autonomous Mobile Robots. InterJournal of Complex Systems, Article, 395 (rivista elettronica: http://www.interjournal.org).
  17. G. Prencipe. Basic Algorithms for the MRMW PRAM Model. Calcolo.Vol.34, 1997, pag. 135--144.

 

Conferences (.pdf)
  1. P. Flocchini, G. Prencipe, N. Santoro, and G. Viglietta. Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. In Proc. of OPODIS 2014, pp. 217--232. LNCS 8878, 2014.
  2. V. Gervasi, G. Prencipe, and V. Volpi. Zombie Swarms: An Investigatin on the Behaviour of Your Undead Relatives. In Proc. of FUN with Algorithms 2014, pp. 206--217. Lipari Island, Sicily, Italy. LNCS 8496, 2014.
  3. S. Das, P. Flocchini, G. Prencipe, and N. Santoro. Synchronized Dancing of Oblivious Chameleons. In Proc. of FUN with Algorithms 2014, pp. 113--124. Lipari Island, Sicily, Italy. LNCS 8496, 2014.
  4. G. Prencipe. Autonomous Mobile Robots: A Distributed Computing Perspective. In Proc. of ALGOSENSORS 2013, pp. 6--21. Barcellona, Spain. LNCS 8243, 2014.
  5. A. K. Datta, L. L. Larmore, L. Pagli and G. Prencipe. Linear Time Distributed Swap Edge Algorithms. In Proc. of CIAC 2013, pp. 122--133. Sophia Antipolis, France, September 5-6, 2013. LNCS 7878.
  6. L. Pagli, G. Prencipe and G. Viglietta. Getting Close Without Touching. In Proc. of SIROCCO 2012, pp. 315--326. Reykjavík, Iceland, Luglio 2012. LNCS 7355.
  7. S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita. The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits. In Proc. of 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), pp.506-515, 2012.
  8. L. Pagli and G. Prencipe. Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. In Proc. of OPODIS 2009, pp. 365--371. Nimes, France, Dicembre 2009. LNCS 5923.
  9. P. Flocchini, T. Mesa Enriquez, L. Pagli, G. Prencipe and N. Santoro. Distributed Computation of All Node Replacements of a Minimum Spanning Tree. In Proc. of EUROPAR 2007. Rennes, France, Agosto 2007.
  10. G. Prencipe and N. Santoro. Distributed Algorithms for Autonomous Mobile Robots. In Proc. of IFIP 2006.
  11. P. Flocchini, G. Prencipe and N. Santoro. Self-Deployment Algorithms for Mobile Sensors on a Ring. In Proc. of 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2006). Venezia, Italia, Luglio 2006.
  12. L. Anderegg, M. Cieliebak and G. Prencipe. Efficient Algorithms for Detecting Regular Point Configurations. Ninth Italian Conference on Teoretical Computer Science (ICTCS 2005), LNCS 3701, pp. 23–35.
  13. G. Prencipe. On The Feasibility of Gathering by Autonomous Mobile Robots. SIROCCO 2005.
  14. P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer and T. Zuva. Computing All the Best Swap Edges Distributively. In 8th International Conference On Principles Of Distributed Systems (OPODIS 2004)
  15. L. Pagli, G. Prencipe and T. Zuva. Distributed Computation for Swapping a Failing Edge. In 6th International Workshop on Distributed Computing (IWDC 2004)
  16. P. Flocchini, A. M. Enriques, L. Pagli, G. Prencipe and N. Santoro. Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. 3rd IFIP International Conference on Theoretical Computer Science (TCS@2004), pp. 153--166. Toulouse, Francia, 23--26 Agosto 2004.
  17. V. Gervasi and G. Prencipe. On The Efficient Capture of Dangerous Criminals. Third International Conference on FUN With Algorithms (FUN 2004), pp. 184--196. Isola d'Elba, Italia, 26--28 Maggio 2004.
  18. S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro. Multiple Agents RendezVous In aRing in Spite of a Black Hole. In 7th International Conference On Principles Of Distributed Systems (OPODIS 2003)
  19. V. Gervasi and G. Prencipe. Robotic Cops: The Intruder Problem. 2003 IEEE Conference on Systems, Man and Cybernetics (SMC 2003), pp. 2284--2289. Washington D. C., USA, 5--8 Ottobre 2003.
  20. M. Cieliebak, P. Flocchini, G. Prencipe and N. Santoro. Solving the Robots Gathering Problem. In 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181--1196. Eindhoven, The Netherlands, 30 Giugno -- 4 Luglio, 2003.
  21. G. Prencipe. The Black Hole Search Problem -- Facing the harmful hosts threats in distributed mobile computing environments. In International Workshop on Interconnection Networks (IWIN 2003). Umeå, Sweden, 16--17 Giugno 2003.
  22. S. Dobrev, P. Flocchini, R. Královic, G. Prencipe, P. Ružička, and N. Santoro. Black Hole Search by Mobile Agents in Hypercubes and Related Networks. In 6th International Conference On Principles Of Distributed Systems (OPODIS 2002), pp. 171--182. Reims, Francia, 11--13 Dicembre 2002.
  23. V. Gervasi and G. Prencipe. On the Intelligent Behavior of Stupid Robots. In VIII Convegno AI*IA, Siena, Italia, 10-13 Settembre 2002.
  24. S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro. Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols. In Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 153--162. Monterey, California, 21--24 Luglio 2002.
  25. M. Cieliebak and G. Prencipe. Gathering Autonomous Mobile Robots. In Proc. VIII International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), pag. 57--72. Andros, Greece, 10--12 Giugno 2002.
  26. F. Dehne, S. Mardegan, A. Pietracaprina and G. Prencipe.   Distribution Sweeping on Clustered Machines with Hierarchical Memories. In Proc.of Interantional Parallel and Distributed Symposium (IPDPS 2002), published on CD-ROM and online by IEEE Computer Society, http://computer.org/proceedings/Fort Lauderdale, Florida, 15--19 Aprile 2002.
  27. G. Prencipe. Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots. In VII Italian Conference on Theoretical Computer Science (ICTCS 2001), LNCS 2202, pag. 154-171. Torino, Italia, 4--6 Ottobre 2001.
  28. S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro. Mobile Search for a Black Hole in an Anonymous Ring. In 15th International Symposium on Distributed Computing (DISC 2001), LNCS 2180, pag. 166-179. Lisboa, Portugal, 3--5 Ottobre 2001.
  29. P. Flocchini, G.Prencipe, N. Santoro, and P. Widmayer. Pattern Formation by Autonomous Robots Without Chirality. In Proc. VIII International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pp. 147--162. Vall de Núnia, Spagna, 27-29 Giugno 2001.
  30. V. Gervasi and G. Prencipe. Need a Fleet? Use The Force! In Fun With Algorithms 2 (FUN 2001), pp. 149--164. Isola d'Elba, Italia, 27-31 Maggio 2001.
  31. G. Prencipe. CORDA: Distributed Coordination of a Set of Autonomous Mobile Robots. In Proc. Fourth European Research Seminar on Advances in Distributed Systems (ERSADS 2001), pp. 185--190. Bertinoro, Italia, Maggio 2001.
  32. P. Flocchini, G.Prencipe, N. Santoro and P. Widmayer. Gathering of Autonomous Mobile Robots With Limited Visibility. In Proc. 18th International Symposium on Theoretical Aspects of Computer Science (STACS 2001), LNCS 2010, pp. 247-258. Dresden, Germania, 15--17 Febbraio 2001.
  33. P. Flocchini, G.Prencipe, N. Santoro and P. Widmayer. Distributed Coordination of a Set of Autonomous Mobile Robots. In IEEE Intelligent Veichle Symposium (IV 2000), pp. 480--485. Dearborn, USA, 3--5 Ottobre 2000.
  34. E. Caceres, A. Chan, F. Dehne and G. Prencipe. Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. In Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), LNCS 1928, pp. 83--94. Konstanz, Germany, 15--17 Giugno 2000.
  35. P. Flocchini, G.Prencipe, N. Santoro and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In Proc. 10th Annual International Symposium on Algorithms and Computation (ISAAC 99), LNCS 1741, pp. 93--102. Chennai, India, 16-18 Dicembre 1999.

Submitted

 

Technical Reports (.pdf)

  1. P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer, and T. Zuva. Computing All the Best Swap Edges Distributively. TR-04-18. Nov. 2004. Università di Pisa, Dipartimento di Informatica.
  2. L. Anderegg, M. Cieliebak, and G. Prencipe. The Weber Point Can Be Found In Linear Time for Points in Biangular Configuration. TR-03-01. Gen. 2003. Università di Pisa, Dipartimento di Informatica.
  3. M. Cieliebak and G. Prencipe. Gathering Autonomous Mobile Robots in Non Totally Symmetric Configurations. TR 309. Set. 2002. ETH Zurich, Department of Computer Science.
  4. G. Prencipe. Achievable Patterns by an Even Number of AutonomousMobile Robots. TR-00-11. Aug. 2000. Università di Pisa, Dipartimento di Informatica
  5. G. Prencipe. A New Distributed Model to Control and Coordinate a Set of Autonomous Mobile Robots: The CORDA Model. TR-00-10.Ago. 2000. Università di Pisa, Dipartimento di Informatica
  6. E. Caceres, A. Chan, F.Dehne, and G. Prencipe. Coarse Grained Parallel Algorithms for DetectingConvex Bipartite Graphs.TR-99-08.Nov. 1999. Carleton University, Department of Computer Science.
  7. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. TR_99_07. Nov. 1999. Carleton University, Department of Computer Science

 

Other

  1. G. Prencipe. Small memory Software -- Patterns for Systems with Limited Memory(recensione del libro omonimo di J. Noble and C. Weir). The Computer Journal, Vol. 45(5), 2002, pag. 574--575. (.pdf)
  2. G. Prencipe. Distributed Coordination of a Set of Autonomous Mobile Robots. TD-4/02 (2002). Dipartimento di Informatica, University of Pisa (.pdf)