An Automatic Speedup Theorem for Distributed Problems

26 February 2019

Papers citing "An Automatic Speedup Theorem for Distributed Problems"

11 / 11 papers shown

Title
Distributed Lovász Local Lemma under Bandwidth Limitations Magnús M. Halldórsson Yannic Maus Saku Peltonen 45 2 0 12 May 2024
Tight Lower Bounds in the Supported LOCAL Model Alkida Balliu Thomas Boudier Sebastian Brandt Dennis Olivetti 29 0 0 01 May 2024
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 30 9 0 14 Feb 2023
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model Franccois Le Gall A. Rosmanis LRM 13 2 0 06 Dec 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 40 7 0 03 Nov 2022
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement Pierre Fraigniaud A. Paz S. Rajsbaum LRM 27 4 0 10 Jun 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 30 18 0 09 Feb 2022
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 21 1 0 04 Aug 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 40 24 0 18 Feb 2021
Truly Tight-in- $Δ$ Bounds for Bipartite Maximal Matching and Variants S. Brandt Dennis Olivetti 15 24 0 19 Feb 2020
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 20 93 0 08 Jan 2019