Alkida Balliu
Alkida Balliu
Bestätigte E-Mail-Adresse bei cs.uni-freiburg.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
312018
Lower bounds for maximal matchings and maximal independent sets
A Balliu, S Brandt, J Hirvonen, D Olivetti, M Rabie, J Suomela
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
282019
What can be verified locally?
A Balliu, G D'Angelo, P Fraigniaud, D Olivetti
Journal of Computer and System Sciences 97, 106-120, 2018
26*2018
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
22*2016
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing, 1-23, 2020
202020
On Pareto optimality in social distance games
A Balliu, M Flammini, D Olivetti
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
182017
On non-cooperativeness in social distance games
A Balliu, M Flammini, G Melideo, D Olivetti
Journal of Artificial Intelligence Research 66, 625-653, 2019
17*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
142019
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
132019
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
132019
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
12*2020
Certification of Compact Low-Stretch Routing Schemes
P Fraigniaud, B Alkida
DISC 2017-31st International Symposium on Distributed Computing, 2017
7*2017
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
arXiv preprint arXiv:2004.08282, 2020
62020
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
Sparsifying congested cliques and core-periphery networks
A Balliu, P Fraigniaud, Z Lotker, D Olivetti
International Colloquium on Structural Information and Communication …, 2016
42016
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
22020
Locally Checkable Problems in Rooted Trees
A Balliu, S Brandt, D Olivetti, J Studený, J Suomela, A Tereshchenko
arXiv preprint arXiv:2102.09277, 2021
2021
Local Mending
A Balliu, J Hirvonen, D Melnyk, D Olivetti, J Rybicki, J Suomela
arXiv preprint arXiv:2102.08703, 2021
2021
PODC 2020 Review
AM Baig, A Balliu, P Davies, M Dory
ACM SIGACT News 51 (4), 75-81, 2021
2021
Distributed Local Decision with Applications to Routing Schemes
A Balliu, P Fraigniaud
2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20