v1v2v3 (latest)

Lower bounds for maximal matchings and maximal independent sets

8 January 2019

Papers citing "Lower bounds for maximal matchings and maximal independent sets"

50 / 55 papers shown

Title
Distributed weak independent sets in hypergraphs: Upper and lower bounds Duncan Adamson Will Rosenbaum Paul G. Spirakis 199 0 0 20 Nov 2024
Distributed Quantum Advantage for Local Problems Alkida Balliu S. Brandt Xavier Coiteux-Roy Francesco d’Amore Massimo Equi ... Dennis Olivetti M. Renou Jukka Suomela Lucas Tendick Isadora Veeren 38 6 0 05 Nov 2024
Shared Randomness Helps with Local Distributed Problems Alkida Balliu Mohsen Ghaffari Fabian Kuhn Augusto Modanese Dennis Olivetti Mikael Rabie Jukka Suomela Jara Uitto 74 4 0 07 Jul 2024
Massively Parallel Ruling Set Made Deterministic Jeff Giliberti Zahra Parsaeian 86 4 0 18 Jun 2024
Distributed Lovász Local Lemma under Bandwidth Limitations Magnús M. Halldórsson Yannic Maus Saku Peltonen 62 2 0 12 May 2024
Self-Stabilizing MIS Computation in the Beeping Model George Giakkoupis Volker Turau Isabella Ziccardi 82 0 0 07 May 2024
Tight Lower Bounds in the Supported LOCAL Model Alkida Balliu Thomas Boudier Sebastian Brandt Dennis Olivetti 60 1 0 01 May 2024
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks Hagit Attiya Pierre Fraigniaud A. Paz S. Rajsbaum LRM 63 3 0 08 Aug 2023
No distributed quantum advantage for approximate graph coloring Xavier Coiteux-Roy Francesco d’Amore Rishikesh R. Gajjala Fabian Kuhn Franccois Le Gall Henrik Lievonen Augusto Modanese M. Renou Gustav Schmid Jukka Suomela 74 15 0 18 Jul 2023
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 51 10 0 19 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 51 13 0 10 May 2023
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model Leonid Barenboim Uri Goldenberg 64 2 0 07 May 2023
Faster Deterministic Distributed MIS and Approximate Matching M. Ghaffari Christoph Grunau 60 23 0 28 Mar 2023
Distributed Half-Integral Matching and Beyond Sameep Dahal Jukka Suomela 32 1 0 09 Mar 2023
Distributed Self-Stabilizing MIS with Few States and Weak Communication George Giakkoupis Isabella Ziccardi 51 5 0 12 Jan 2023
Recurrent Problems in the LOCAL model A. Agrawal John E. Augustine David Peleg Srikkanth Ramachandran 55 1 0 30 Dec 2022
Fast Distributed Brooks' Theorem Manuela Fischer Yannic Maus Magnús M. Halldórsson OOD 54 17 0 14 Nov 2022
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks Neta Rozen Schiff Klaus-Tycho Foerster Stefan Schmid David Hay 142 6 0 11 Nov 2022
Optimal Deterministic Massively Parallel Connectivity on Forests Alkida Balliu R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 68 5 0 07 Nov 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 68 8 0 03 Nov 2022
Self-stabilization and byzantine tolerance for maximal independent Johanne Cohen Laurence Pilard François Pirot Jonas Sénizergues 25 0 0 12 Oct 2022
Making Self-Stabilizing any Locally Greedy Problem Johanne Cohen Laurence Pilard Mikael Rabie Jonas Sénizergues 54 3 0 31 Aug 2022
Exponential Speedup Over Locality in MPC with Optimal Memory Alkida Balliu S. Brandt Manuela Fischer R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 62 5 0 19 Aug 2022
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement Pierre Fraigniaud A. Paz S. Rajsbaum LRM 126 4 0 10 Jun 2022
Distributed Edge Coloring in Time Polylogarithmic in $Δ$ Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 54 18 0 02 Jun 2022
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees S. Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 42 1 0 20 Apr 2022
$Distributed MIS in $O(\log\log{n} )$ Awake Complexity$ Distributed MIS in $O(\log\log{n} )$ Awake Complexity Fabien Dufoulon W. Moses Gopal Pandurangan 68 12 0 18 Apr 2022
Efficient Classification of Locally Checkable Problems in Regular Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela 52 8 0 17 Feb 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 59 20 0 09 Feb 2022
Distributed $Δ$ -Coloring Plays Hide-and-Seek Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 72 29 0 01 Oct 2021
Locality in online, dynamic, sequential, and distributed graph algorithms Amir Akbari N. Eslami Henrik Lievonen Darya Melnyk Joona Särkijärvi Jukka Suomela 63 10 0 14 Sep 2021
Sinkless Orientation Made Simple Alkida Balliu Janne H. Korhonen Fabian Kuhn Henrik Lievonen Dennis Olivetti ... Joel Rybicki Stefan Schmid Jan Studený Jukka Suomela Jara Uitto LRM 53 5 0 05 Aug 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 115 1 0 04 Aug 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 50 18 0 04 Jun 2021
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics Sebastian Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 41 28 0 03 Jun 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 61 24 0 03 Jun 2021
Distributed Graph Coloring Made Easy Yannic Maus 65 25 0 12 May 2021
Locally Checkable Labelings with Small Messages Alkida Balliu K. Censor-Hillel Yannic Maus Dennis Olivetti Jukka Suomela 47 16 0 12 May 2021
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication C. Konrad Peter Robinson Viktor Zamaraev 53 2 0 12 Mar 2021
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory J. Hirvonen Laura Schmid K. Chatterjee Stefan Schmid 25 0 0 26 Feb 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 73 28 0 18 Feb 2021
Local Conflict Coloring Revisited: Linial for Lists Yannic Maus Tigran Tonoyan 43 41 0 30 Jul 2020
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 65 34 0 12 Jun 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 57 41 0 17 Apr 2020
The Topology of Local Computing in Networks Pierre Fraigniaud A. Paz 52 13 0 06 Mar 2020
Truly Tight-in- $Δ$ Bounds for Bipartite Maximal Matching and Variants S. Brandt Dennis Olivetti 45 26 0 19 Feb 2020
Distributed graph problems through an automata-theoretic lens Yi-Jun Chang Jan Studený Jukka Suomela 64 20 0 18 Feb 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 62 8 0 18 Feb 2020
A Breezing Proof of the KMW Bound Corinna Coupette Christoph Lenzen 67 5 0 14 Feb 2020
Classification of distributed binary labeling problems Alkida Balliu S. Brandt Yuval Efron J. Hirvonen Yannic Maus Dennis Olivetti Jukka Suomela 56 44 0 29 Nov 2019