Follow
Alkida Balliu
Alkida Balliu
Gran Sasso Science Institute
Verified email at gssi.it - Homepage
Title
Cited by
Cited by
Year
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
762021
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
432018
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
422019
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing 34, 259-281, 2021
352021
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
SIAM Journal on Computing 51 (1), 70-115, 2022
302022
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
282019
A big data analyzer for large trace logs
A Balliu, D Olivetti, O Babaoglu, M Marzolla, A SÓrbu
Computing 98, 1225-1249, 2016
25*2016
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
232019
On pareto optimality in social distance games
A Balliu, M Flammini, D Olivetti
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
222017
On non-cooperativeness in social distance games
A Balliu, M Flammini, G Melideo, D Olivetti
Journal of Artificial Intelligence Research 66, 625-653, 2019
20*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
18*2020
What can be verified locally?
A Balliu, G D'Angelo, P Fraigniaud, D Olivetti
Journal of Computer and System Sciences 97, 106-120, 2018
18*2018
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
172021
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
162017
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
102021
Locality of not-so-weak coloring
A Balliu, J Hirvonen, C Lenzen, D Olivetti, J Suomela
Structural Information and Communication Complexity: 26th International†…, 2019
102019
Locally checkable labelings with small messages
A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:2105.05574, 2021
92021
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
8*2022
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
82020
Local mending
A Balliu, J Hirvonen, D Melnyk, D Olivetti, J Rybicki, J Suomela
Structural Information and Communication Complexity: 29th International†…, 2022
72022
The system can't perform the operation now. Try again later.
Articles 1–20