| Lower bounds for maximal matchings and maximal independent sets A Balliu, S Brandt, J Hirvonen, D Olivetti, M Rabie, J Suomela Journal of the ACM (JACM) 68 (5), 1-30, 2021 | 97 | 2021 |
| New classes of distributed time complexity A Balliu, J Hirvonen, JH Korhonen, T Lempiäinen, D Olivetti, J Suomela Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 51 | 2018 |
| Classification of distributed binary labeling problems A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela arXiv preprint arXiv:1911.13294, 2019 | 48 | 2019 |
| Almost global problems in the LOCAL model A Balliu, S Brandt, D Olivetti, J Suomela Distributed Computing 34, 259-281, 2021 | 42 | 2021 |
| Distributed lower bounds for ruling sets A Balliu, S Brandt, D Olivetti SIAM Journal on Computing 51 (1), 70-115, 2022 | 34 | 2022 |
| Hardness of minimal symmetry breaking in distributed computing A Balliu, J Hirvonen, D Olivetti, J Suomela Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 31 | 2019 |
| The distributed complexity of locally checkable problems on paths is decidable A Balliu, S Brandt, YJ Chang, D Olivetti, M Rabie, J Suomela Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 28 | 2019 |
| What can be verified locally? A Balliu, G D'Angelo, P Fraigniaud, D Olivetti Journal of Computer and System Sciences 97, 106-120, 2018 | 27* | 2018 |
| On pareto optimality in social distance games A Balliu, M Flammini, D Olivetti Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 26* | 2017 |
| A big data analyzer for large trace logs A Balliu, D Olivetti, O Babaoglu, M Marzolla, A Sîrbu Computing 98, 1225-1249, 2016 | 26* | 2016 |
| How much does randomness help with locally checkable problems? A Balliu, S Brandt, D Olivetti, J Suomela Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 25 | 2020 |
| On non-cooperativeness in social distance games A Balliu, M Flammini, G Melideo, D Olivetti Journal of Artificial Intelligence Research 66, 625-653, 2019 | 24* | 2019 |
| Locally checkable problems in rooted trees A Balliu, S Brandt, D Olivetti, J Studený, J Suomela, A Tereshchenko Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 23 | 2021 |
| What can be verified locally? A Balliu, G D'Angelo, P Fraigniaud, D Olivetti 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017 | 16 | 2017 |
| Distributed∆-coloring plays hide-and-seek A Balliu, S Brandt, F Kuhn, D Olivetti Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 14* | 2022 |
| Locally checkable labelings with small messages A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela arXiv preprint arXiv:2105.05574, 2021 | 14 | 2021 |
| Locality of not-so-weak coloring A Balliu, J Hirvonen, C Lenzen, D Olivetti, J Suomela International Colloquium on Structural Information and Communication …, 2019 | 13 | 2019 |
| Improved distributed lower bounds for MIS and bounded (out-) degree dominating sets in trees A Balliu, S Brandt, F Kuhn, D Olivetti Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 12 | 2021 |
| Distributed edge coloring in time quasi-polylogarithmic in delta A Balliu, F Kuhn, D Olivetti Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 11 | 2020 |
| Local mending A Balliu, J Hirvonen, D Melnyk, D Olivetti, J Rybicki, J Suomela International Colloquium on Structural Information and Communication …, 2022 | 9 | 2022 |
Dennis OlivettiGran Sasso Science InstituteVerified email at gssi.it
