Alkida Balliu
Alkida Balliu
Verified email at cs.uni-freiburg.de - 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
412021
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
372018
What can be verified locally?
A Balliu, G D'Angelo, P Fraigniaud, D Olivetti
Journal of Computer and System Sciences 97, 106-120, 2018
30*2018
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing 34 (4), 259-281, 2021
262021
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
262019
On pareto optimality in social distance games
A Balliu, M Flammini, D Olivetti
Thirty-First AAAI Conference on Artificial Intelligence, 2017
242017
A big data analyzer for large trace logs
A Balliu, D Olivetti, O Babaoglu, M Marzolla, A SÓrbu
Computing 98 (12), 1225-1249, 2016
23*2016
On non-cooperativeness in social distance games
A Balliu, M Flammini, G Melideo, D Olivetti
Journal of Artificial Intelligence Research 66, 625-653, 2019
22*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
212019
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
16*2020
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
162019
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS†…, 2020
122020
Certification of Compact Low-Stretch Routing Schemes
P Fraigniaud, B Alkida
DISC 2017-31st International Symposium on Distributed Computing, 2017
7*2017
Locality of not-so-weak coloring
A Balliu, J Hirvonen, C Lenzen, D Olivetti, J Suomela
International Colloquium on Structural Information and Communication†…, 2019
62019
Locally checkable problems in rooted trees
A Balliu, S Brandt, D Olivetti, J Studenż, J Suomela, A Tereshchenko
arXiv preprint arXiv:2102.09277, 2021
52021
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
52020
Sparsifying congested cliques and core-periphery networks
A Balliu, P Fraigniaud, Z Lotker, D Olivetti
International Colloquium on Structural Information and Communication†…, 2016
42016
Improved distributed lower bounds for mis and bounded (out-) degree dominating sets in trees
A Balliu, S Brandt, F Kuhn, D Olivetti
arXiv preprint arXiv:2106.02440, 2021
22021
Locally Checkable Labelings with Small Messages
A Balliu, K Censor-Hillel, Y Maus, D Olivetti, J Suomela
arXiv preprint arXiv:2105.05574, 2021
22021
Local Mending
A Balliu, J Hirvonen, D Melnyk, D Olivetti, J Rybicki, J Suomela
arXiv preprint arXiv:2102.08703, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20