Dennis Olivetti

Available identifiers

zbMath Open olivetti.dennisMaRDI QIDQ1672005

List of research outcomes

Publication	Date of Publication	Type
Optimal deterministic massively parallel connectivity on forests	2024-05-14	Paper
Distributed maximal matching and maximal independent set on hypergraphs	2024-05-14	Paper
Sinkless orientation made simple	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6128580	2024-04-15	Paper
Locally checkable problems in rooted trees	2024-03-26	Paper
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees	2024-03-26	Paper
Node and Edge Averaged Complexities of Local Graph Problems	2024-03-26	Paper
Distributed Edge Coloring in Time Polylogarithmic in Δ	2024-03-26	Paper
Locally checkable labelings with small messages	2023-12-08	Paper
Distributed ∆-coloring plays hide-and-seek	2023-12-08	Paper
Node and edge averaged complexities of local graph problems	2023-11-21	Paper
Classification of distributed binary labeling problems	2023-11-02	Paper
Locally checkable problems in rooted trees	2023-09-11	Paper
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs	2023-04-03	Paper
Three notes on distributed property testing	2023-02-03	Paper
Lower Bounds for Maximal Matchings and Maximal Independent Sets	2022-12-08	Paper
Local mending	2022-11-11	Paper
On Pareto optimality in social distance games	2022-11-08	Paper
Almost global problems in the LOCAL model	2022-07-21	Paper
Distributed Lower Bounds for Ruling Sets	2022-03-11	Paper
Almost global problems in the LOCAL model	2021-09-06	Paper
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants	2021-03-15	Paper
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta	2021-03-15	Paper
How much does randomness help with locally checkable problems?	2021-03-15	Paper
Brief Announcement: Classification of Distributed Binary Labeling Problems	2021-03-15	Paper
Brief Announcement: Round eliminator: a tool for automatic speedup simulation	2021-03-15	Paper
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable	2021-01-20	Paper
Hardness of Minimal Symmetry Breaking in Distributed Computing	2021-01-20	Paper
Locality of not-so-weak coloring	2020-03-03	Paper
On Non-Cooperativeness in Social Distance Games	2019-11-26	Paper
New classes of distributed time complexity	2019-08-22	Paper
What can be verified locally?	2018-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4636605	2018-04-19	Paper
Sparsifying Congested Cliques and Core-Periphery Networks	2016-12-01	Paper

Research outcomes over time

This page was built for person: Dennis Olivetti