On the public citation graph
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma
0 signed · 63 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1098-2418(200010/12)17:3/4<376::aid-rsa10>3.0.co;2-0openalex-snapshot
Near-optimal list colorings
inferredcites →https://doi.org/10.1002/rsa.3240020402openalex-snapshot
An algorithmic approach to the Lovász local lemma. I
inferredcites →https://doi.org/10.1006/jagm.1996.0017openalex-snapshot
On the Complexity of Distributed Network Decomposition
inferredcites →https://doi.org/10.1007/978-3-642-04016-0openalex-snapshot
Graph Colouring and the Probabilistic Method
inferredcites →https://doi.org/10.1007/bf01200759openalex-snapshot
The local nature of ?-coloring and its algorithmic applications
inferredcites →https://doi.org/10.1007/s00446-012-0167-7openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferredcites →https://doi.org/10.1007/s00446-012-0174-8openalex-snapshot
Toward more localized local algorithms: removing assumptions concerning global knowledge
inferredcites →https://doi.org/10.1007/s00446-016-0287-6openalex-snapshot
Distributed algorithms for the Lovász local lemma and graph coloring
inferredcites →https://doi.org/10.1007/s00493-014-2897-6openalex-snapshot
Regular graphs of large girth and arbitrary degree
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0196-6774(87)90026-5openalex-snapshot
Efficient parallel algorithms for edge coloring problems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1016/s0304-3975(98)00022-xopenalex-snapshot
Near-optimal, distributed edge colouring via the nibble method
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1017/s0963548397003246openalex-snapshot
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
inferredcites →https://doi.org/10.1109/focs.2019.00048openalex-snapshot
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs
inferredcites →https://doi.org/10.1109/sfcs.2003.1238173openalex-snapshot
Proceedings 44th IEEE Symposium on Foundations of Computer Science - FOCS 2003
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/0404036openalex-snapshot
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
inferredcites →https://doi.org/10.1137/1.9780898715583openalex-snapshot
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/1.9781611973730.26openalex-snapshot
(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting
inferredcites →https://doi.org/10.1137/1.9781611974782.166openalex-snapshot
Distributed Degree Splitting, Edge Coloring, and Orientations
inferredcites →https://doi.org/10.1137/12088848xopenalex-snapshot
Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
inferredcites →https://doi.org/10.1137/17m1117537openalex-snapshot
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
inferredcites →https://doi.org/10.1137/17m1157957openalex-snapshot
A Time Hierarchy Theorem for the LOCAL Model
inferredcites →https://doi.org/10.1137/s0097539793250767openalex-snapshot
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
inferredcites →https://doi.org/10.1137/s0097539793254571openalex-snapshot
What Can be Computed Locally?
inferredcites →https://doi.org/10.1145/1667053.1667060openalex-snapshot
A constructive proof of the general lovász local lemma
inferredcites →https://doi.org/10.1145/2027216.2027221openalex-snapshot
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
inferredcites →https://doi.org/10.1145/2767386.2767410openalex-snapshot
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks
inferredcites →https://doi.org/10.1145/2903137openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferredcites →https://doi.org/10.1145/3178120openalex-snapshot
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_5openalex-snapshot
Distributed Coloring of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_15openalex-snapshot
Verifying Algorithmic Versions of the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1007/s00446-020-00375-2openalex-snapshot
Almost global problems in the LOCAL model
inferred← citeshttps://doi.org/10.1007/s00446-024-00461-9openalex-snapshot
Component stability in low-space massively parallel computation
inferred← citeshttps://doi.org/10.1007/s00446-025-00477-9openalex-snapshot
Exponential speedup over locality in MPC with optimal memory
inferred← citeshttps://doi.org/10.1090/tran/9455openalex-snapshot
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00042openalex-snapshot
Distributed Lower Bounds for Ruling Sets
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00128openalex-snapshot
Faster $(\Delta+1)$-Edge Coloring: Breaking the $m\sqrt{n}$ Time Barrier
inferred← citeshttps://doi.org/10.1137/24m1715866openalex-snapshot
Distributed Edge Coloring in Time Polylogarithmic in \({\Delta }\)
inferred← citeshttps://doi.org/10.1145/3465084.3467901openalex-snapshot
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
inferred← citeshttps://doi.org/10.1145/3465084.3467903openalex-snapshot
Component Stability in Low-Space Massively Parallel Computation
inferred← citeshttps://doi.org/10.1145/3519270.3538440openalex-snapshot
Distributed Edge Coloring in Time Polylogarithmic in Δ
inferred← citeshttps://doi.org/10.1145/3519935.3520027openalex-snapshot
Distributed ∆-coloring plays hide-and-seek
inferred← citeshttps://doi.org/10.1145/3717823.3718103openalex-snapshot
On the Locality of the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3717823.3718265openalex-snapshot
Vizing’s Theorem in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/3717823.3718320openalex-snapshot
Faster Distributed Δ-Coloring via Ruling Subgraphs
inferred← citeshttps://doi.org/10.1145/3732772.3733547openalex-snapshot
Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs
inferred← citeshttps://doi.org/10.1145/3732772.3733565openalex-snapshot
Towards Optimal Deterministic LOCAL Algorithms on Trees
inferred← citeshttps://doi.org/10.1145/3796701.3815951openalex-snapshot
Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST
inferred← citeshttps://doi.org/10.1145/3798129.3800899openalex-snapshot
Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
inferred← citeshttps://doi.org/10.1145/3819817openalex-snapshot
Distributed Δ-Coloring Plays Hide-and-Seek
inferred← citeshttps://doi.org/10.3390/a14120355openalex-snapshot
A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results—A Survey
inferred← citeshttps://doi.org/10.3934/math.2026798openalex-snapshot
The Lovász local lemma: foundations and applications
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.18openalex-snapshot
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.29openalex-snapshot
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.