| Classic Nintendo games are (computationally) hard G Aloupis, ED Demaine, A Guo, G Viglietta Theoretical Computer Science 586, 135-160, 2015 | 155 | 2015 |
| Mutual visibility by luminous robots without collisions GA Di Luna, P Flocchini, SG Chaudhuri, F Poloni, N Santoro, G Viglietta Information and Computation 254, 392-418, 2017 | 124 | 2017 |
| Gaming is a hard job, but someone has to do it! G Viglietta Theory of Computing Systems 54 (4), 595-621, 2014 | 94 | 2014 |
| Distributed computing by mobile robots: uniform circle formation P Flocchini, G Prencipe, N Santoro, G Viglietta Distributed Computing 30 (6), 413-457, 2017 | 92 | 2017 |
| Shape formation by programmable particles GA Di Luna, P Flocchini, N Santoro, G Viglietta, Y Yamauchi Distributed Computing 33 (1), 69-101, 2020 | 84 | 2020 |
| Rendezvous of two robots with visible bits G Viglietta International Symposium on Algorithms and Experiments for Sensor Systems …, 2013 | 70 | 2013 |
| Gathering in dynamic rings GA Di Luna, P Flocchini, L Pagli, G Prencipe, N Santoro, G Viglietta Theoretical Computer Science 811, 79-98, 2020 | 67 | 2020 |
| Rendezvous with constant memory P Flocchini, N Santoro, G Viglietta, M Yamashita Theoretical Computer Science 621, 57-72, 2016 | 66 | 2016 |
| The mutual visibility problem for oblivious robots G Di Luna, P Flocchini, F Poloni, N Santoro, G Viglietta 26th Canadian Conference on Computational Geometry, CCCG 2014, 2014 | 58 | 2014 |
| Robots with lights: Overcoming obstructed visibility without colliding GA Di Luna, P Flocchini, S Gan Chaudhuri, N Santoro, G Viglietta Symposium on Self-Stabilizing Systems, 150-164, 2014 | 54 | 2014 |
| Getting close without touching: near-gathering for autonomous mobile robots L Pagli, G Prencipe, G Viglietta Distributed Computing 28 (5), 333-349, 2015 | 42 | 2015 |
| Rendezvous of two robots with constant memory P Flocchini, N Santoro, G Viglietta, M Yamashita International Colloquium on Structural Information and Communication …, 2013 | 41 | 2013 |
| Super Mario Bros. is harder/easier than we thought ED Demaine, G Viglietta, A Williams | 37 | 2016 |
| Square formation by asynchronous oblivious robots M Mamino, G Viglietta arXiv preprint arXiv:1605.06093, 2016 | 33 | 2016 |
| Lemmings is PSPACE-complete G Viglietta Theoretical Computer Science 586, 120-134, 2015 | 30 | 2015 |
| Line recovery by programmable particles GA Di Luna, P Flocchini, G Prencipe, N Santoro, G Viglietta Proceedings of the 19th International Conference on Distributed Computing …, 2018 | 29 | 2018 |
| Distributed computing by mobile robots: Solving the uniform circle formation problem P Flocchini, G Prencipe, N Santoro, G Viglietta International Conference on Principles of Distributed Systems, 217-232, 2014 | 28 | 2014 |
| Getting close without touching L Pagli, G Prencipe, G Viglietta International Colloquium on Structural Information and Communication …, 2012 | 23 | 2012 |
| Hardness of mastermind G Viglietta International Conference on Fun with Algorithms, 368-378, 2012 | 23 | 2012 |
| TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications GAD Luna, P Flocchini, N Santoro, G Viglietta Distributed Computing 35 (2), 105-122, 2022 | 22 | 2022 |
Paola FlocchiniUniversity of OttawaVerified email at eecs.uottawa.ca
