Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity

v1v2 (latest)

Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity

24 May 2018

Leonid Barenboim

ArXiv (abs)PDF HTML

Papers citing "Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity"

8 / 8 papers shown

Title
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost Alkida Balliu Pierre Fraigniaud Dennis Olivetti Mikael Rabie 63 0 0 27 Oct 2024
Completing the Node-Averaged Complexity Landscape of LCLs on Trees Alkida Balliu Sebastian Brandt Fabian Kuhn Dennis Olivetti Gustav Schmid 49 2 0 02 May 2024
On the Node-Averaged Complexity of Locally Checkable Problems on Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti Gustav Schmid 37 4 0 08 Aug 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 48 13 0 10 May 2023
Node and Edge Averaged Complexities of Local Graph Problems Alkida Balliu M. Ghaffari Fabian Kuhn Dennis Olivetti 60 7 0 17 Aug 2022
Sleeping Model: Local and Dynamic Algorithms Tzalik Maimon 24 4 0 10 Dec 2021
Deterministic Logarithmic Completeness in the Distributed Sleeping Model Leonid Barenboim Tzalik Maimon 25 21 0 04 Aug 2021
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 59 34 0 12 Jun 2020