Dennis Olivetti

Orcid: 0000-0002-6600-6443

According to our database1, Dennis Olivetti authored at least 44 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Node and edge averaged complexities of local graph problems.
Distributed Comput., December, 2023

Locally checkable problems in rooted trees.
Distributed Comput., September, 2023

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR, 2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Sinkless Orientation Made Simple.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Optimal Deterministic Massively Parallel Connectivity on Forests.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Distributed Lower Bounds for Ruling Sets.
SIAM J. Comput., 2022

Efficient Classification of Local Problems in Regular Trees.
CoRR, 2022

On Pareto optimality in social distance games.
Artif. Intell., 2022

Exponential Speedup over Locality in MPC with Optimal Memory.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Distributed ∆-coloring plays hide-and-seek.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Local Mending.
Proceedings of the Structural Information and Communication Complexity, 2022

Distributed Edge Coloring in Time Polylogarithmic in Δ.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Lower Bounds for Maximal Matchings and Maximal Independent Sets.
J. ACM, 2021

Almost global problems in the LOCAL model.
Distributed Comput., 2021

Distributed Δ-Coloring Plays Hide-and-Seek.
CoRR, 2021

Locally Checkable Labelings with Small Messages.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Locally Checkable Problems in Rooted Trees.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Distributed Fractional Coloring Algorithms.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020
Classification of Distributed Binary Labeling Problems.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Round eliminator: a tool for automatic speedup simulation.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

How much does randomness help with locally checkable problems?
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Distributed Detection of Cycles.
ACM Trans. Parallel Comput., 2019

On Non-Cooperativeness in Social Distance Games.
J. Artif. Intell. Res., 2019

Locality of Not-so-Weak Coloring.
Proceedings of the Structural Information and Communication Complexity, 2019

Hardness of Minimal Symmetry Breaking in Distributed Computing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
What can be verified locally?
J. Comput. Syst. Sci., 2018

New classes of distributed time complexity.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
How Bandwidth Affects the CONGEST Model.
CoRR, 2017

Distributed Subgraph Detection.
CoRR, 2017

Three Notes on Distributed Property Testing.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

On Pareto Optimality in Social Distance Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Nash Stability in Social Distance Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Local Distributed Verification.
CoRR, 2016

A Big Data analyzer for large trace logs.
Computing, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.
Proceedings of the Structural Information and Communication Complexity, 2016

2014
BiDAl: Big Data Analyzer for Cluster Traces.
Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Big Data, 2014


  Loading...