| 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 | 107 | 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 | 54 | 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 | 52 | 2019 |
| Three notes on distributed property testing G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ... 31st International Symposium on Distributed Computing (DISC 2017), 2017 | 52* | 2017 |
| Almost global problems in the LOCAL model A Balliu, S Brandt, D Olivetti, J Suomela Distributed Computing 34, 259-281, 2021 | 46 | 2021 |
| Distributed lower bounds for ruling sets A Balliu, S Brandt, D Olivetti 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 37 | 2020 |
| Distributed detection of cycles P Fraigniaud, D Olivetti ACM Transactions on Parallel Computing (TOPC) 6 (3), 12, 2019 | 32 | 2019 |
| 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 | 30 | 2019 |
| 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 | 29 | 2020 |
| 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 | 27 | 2021 |
| 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 |
| Truly tight-in-δ bounds for bipartite maximal matching and variants S Brandt, D Olivetti Proceedings of the 39th Symposium on Principles of Distributed Computing, 69-78, 2020 | 26 | 2020 |
| 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 |
| Round Eliminator: a tool for automatic speedup simulation D Olivetti | 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 | 25* | 2019 |
| Distributed∆-Coloring Plays Hide-and-Seek A Balliu, S Brandt, F Kuhn, D Olivetti Proccedings of the 54nd Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 23* | 2022 |
| Locally Checkable Labelings with Small Messages A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela arXiv preprint arXiv:2105.05574, 2021 | 19 | 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 |
Alkida BalliuGran Sasso Science InstituteVerified email at gssi.it
