Dennis Olivetti
Titolo
Citata da
Citata da
Anno
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
382019
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
362018
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
34*2017
What can be verified locally?
A Balliu, G D'Angelo, P Fraigniaud, D Olivetti
Journal of Computer and System Sciences 97, 106-120, 2018
28*2018
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing 34 (4), 259-281, 2021
252021
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
252019
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 Pareto optimality in social distance games
A Balliu, M Flammini, D Olivetti
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
212017
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
202019
On Non-Cooperativeness in Social Distance Games
A Balliu, M Flammini, G Melideo, D Olivetti
Journal of Artificial Intelligence Research 66, 625-653, 2019
19*2019
Distributed detection of cycles
P Fraigniaud, D Olivetti
ACM Transactions on Parallel Computing (TOPC) 6 (3), 12, 2019
182019
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
Round Eliminator: a tool for automatic speedup simulation
D Olivetti
122020
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS†…, 2020
102020
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
82020
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
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
32020
Il sistema al momento non puÚ eseguire l'operazione. Riprova piý tardi.
Articoli 1–20