Cover Image

On the Locality of the Lovász Local Lemma

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Davies-Peck, Peter
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)

Balls and Bins and the Infinite Process with Random Deletions
by: Berenbrink, Petra, et al.
Published: (2025)

Long-term balanced allocation via thinning
by: Feldheim, Ohad N., et al.
Published: (2021)

The Local Information Cost of Distributed Graph Spanners
by: Robinson, Peter
Published: (2020)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
by: Sanders, Peter, et al.
Published: (2024)

On the Locality of Hall's Theorem
by: Brandt, Sebastian, et al.
Published: (2025)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

Congested Clique Counting for Local Gibbs Distributions
by: Sobel, Joshua Z.
Published: (2025)

On the Randomized Locality of Matching Problems in Regular Graphs
by: Khoury, Seri, et al.
Published: (2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

Invitation to Local Algorithms
by: Rozhoň, Václav
Published: (2024)

Parallel Sampling via Autospeculation
by: Anari, Nima, et al.
Published: (2025)

A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)

What Can We Compute in a Single Round of the Congested Clique?
by: Robinson, Peter
Published: (2022)

Local certification of forbidden subgraphs
by: Bousquet, Nicolas, et al.
Published: (2024)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
by: Robinson, Peter, et al.
Published: (2025)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Tight Bounds on the Message Complexity of Distributed Tree Verification
by: Kutten, Shay, et al.
Published: (2024)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

Scalable Fault-Tolerant MapReduce
by: Hespe, Demian, et al.
Published: (2024)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Message Optimality and Message-Time Trade-offs for APSP and Beyond
by: Dufoulon, Fabien, et al.
Published: (2025)

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)

Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
by: Dufoulon, Fabien, et al.
Published: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
by: Streit, Robert, et al.
Published: (2025)

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Weighted Matching in a Poly-Streaming Model
by: Ullah, Ahammed, et al.
Published: (2025)

Computing in a Faulty Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)

Optimal Distributed Replacement Paths
by: Chang, Yi-Jun, et al.
Published: (2025)