Dennis Olivetti

Orcid: 0000-0002-6600-6443

According to our database¹, Dennis Olivetti authored at least 57 papers between 2014 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Distributed Algorithms for Potential Problems.

[BibT_eX]

[DOI]

CoRR, July, 2025

Distributed Quantum Advantage in Locally Checkable Labeling Problems.

[BibT_eX]

[DOI]

CoRR, April, 2025

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Towards Fully Automatic Distributed Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Distributed Computation with Local Advice.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Distributed Quantum Advantage for Local Problems.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Shared Randomness Helps with Local Distributed Problems.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Local Advice and Local Decompression.

[BibT_eX]

[DOI]

CoRR, 2024

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs.

[BibT_eX]

[DOI]

Alkida Balliu

Pierre Fraigniaud

Patrick Lambein-Monette

Dennis Olivetti

Mikaël Rabie

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Tight Lower Bounds in the Supported LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Completing the Node-Averaged Complexity Landscape of LCLs on Trees.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Brief Announcement: Local Advice and Local Decompression.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Locally checkable problems in rooted trees.

[BibT_eX]

[DOI]

Aleksandr Tereshchenko

Distributed Comput., September, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Sinkless Orientation Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Optimal Deterministic Massively Parallel Connectivity on Forests.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Efficient Classification of Local Problems in Regular Trees.

[BibT_eX]

[DOI]

CoRR, 2022

On Pareto optimality in social distance games.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Exponential Speedup over Locality in MPC with Optimal Memory.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Distributed ∆-coloring plays hide-and-seek.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Local Mending.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2022

Distributed Edge Coloring in Time Polylogarithmic in Δ.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Node and Edge Averaged Complexities of Local Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Distributed Δ-Coloring Plays Hide-and-Seek.

[BibT_eX]

[DOI]

CoRR, 2021

Locally Checkable Labelings with Small Messages.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Locally Checkable Problems in Rooted Trees.

[BibT_eX]

[DOI]

Aleksandr Tereshchenko

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.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Distributed Fractional Coloring Algorithms.

[BibT_eX]

[DOI]

Alkida Balliu

Fabian Kuhn

Dennis Olivetti

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Round eliminator: a tool for automatic speedup simulation.

[BibT_eX]

[DOI]

Dennis Olivetti

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta.

[BibT_eX]

[DOI]

Alkida Balliu

Fabian Kuhn

Dennis Olivetti

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

How much does randomness help with locally checkable problems?

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants.

[BibT_eX]

[DOI]

Sebastian Brandt

Dennis Olivetti

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Lower Bounds for Ruling Sets.

[BibT_eX]

[DOI]

Alkida Balliu

Sebastian Brandt

Dennis Olivetti

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

On Non-Cooperativeness in Social Distance Games.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Locality of Not-so-Weak Coloring.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Hardness of Minimal Symmetry Breaking in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Lower Bounds for Maximal Matchings and Maximal Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Almost Global Problems in the LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

New classes of distributed time complexity.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

How Bandwidth Affects the CONGEST Model.

[BibT_eX]

[DOI]

Dennis Olivetti

CoRR, 2017

Distributed Subgraph Detection.

[BibT_eX]

[DOI]

CoRR, 2017

Three Notes on Distributed Property Testing.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

What Can Be Verified Locally?.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Distributed Detection of Cycles.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Dennis Olivetti

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

On Pareto Optimality in Social Distance Games.

[BibT_eX]

[DOI]

Alkida Balliu

Michele Flammini

Dennis Olivetti

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Nash Stability in Social Distance Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Local Distributed Verification.

[BibT_eX]

[DOI]

CoRR, 2016

A Big Data analyzer for large trace logs.

[BibT_eX]

[DOI]

Computing, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

2014

BiDAl: Big Data Analyzer for Cluster Traces.

[BibT_eX]

[DOI]

Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Big Data, 2014

Dennis Olivetti

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...