Æȷοì
Alkida Balliu
Alkida Balliu
Gran Sasso Science Institute
gssi.itÀÇ À̸ÞÀÏ È®ÀÎµÊ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
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
1102021
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
542018
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
522019
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing 34, 259-281, 2021
482021
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
SIAM Journal on Computing 51 (1), 70-115, 2022
392022
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
322019
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
312019
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
302020
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
282021
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
A big data analyzer for large trace logs
A Balliu, D Olivetti, O Babaoglu, M Marzolla, A Sîrbu
Computing 98, 1225-1249, 2016
27*2016
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
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
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ¡¦, 2022
222022
Locally checkable labelings with small messages
A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:2105.05574, 2021
202021
Distributed edge coloring in time polylogarithmic in ¥Ä
A Balliu, S Brandt, F Kuhn, D Olivetti
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing ¡¦, 2022
182022
Locality of not-so-weak coloring
A Balliu, J Hirvonen, C Lenzen, D Olivetti, J Suomela
International Colloquium on Structural Information and Communication ¡¦, 2019
172019
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
152021
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
152020
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20