On the public citation graph
Deterministic Algorithms for the Lovász Local Lemma
0 signed · 55 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/(sici)1098-2418(199808)13:1<1::aid-rsa1>3.0.co;2-wopenalex-snapshot
Efficient approximation of product distributions
inferredcites →https://doi.org/10.1002/1098-2418(200010/12)17:3/4<213::aid-rsa3>3.0.co;2-yopenalex-snapshot
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
inferredcites →https://doi.org/10.1002/rsa.3240020402openalex-snapshot
An algorithmic approach to the Lovász local lemma. I
inferredcites →https://doi.org/10.1002/rsa.3240020403openalex-snapshot
A parallel algorithmic version of the local lemma
inferredcites →https://doi.org/10.1006/jcss.1999.1695openalex-snapshot
Improved Algorithms via Approximations of Probability Distributions
inferredcites →https://doi.org/10.1007/bf01215349openalex-snapshot
Packet routing and job-shop scheduling inO(congestion+dilation) steps
inferredcites →https://doi.org/10.1016/0097-3165(75)90071-0openalex-snapshot
Ramsey's theorem—A new lower bound
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.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
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/2049697.2049702openalex-snapshot
New Constructive Aspects of the Lovász Local Lemma
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22670openalex-snapshot
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
inferred← citeshttps://doi.org/10.1002/rsa.21152openalex-snapshot
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_1openalex-snapshot
The Lovász Local Lemma – A Survey
inferred← citeshttps://doi.org/10.1007/s00446-016-0287-6openalex-snapshot
Distributed algorithms for the Lovász local lemma and graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-017-0303-5openalex-snapshot
Reliable Communication over Highly Connected Noisy Networks
inferred← citeshttps://doi.org/10.1007/s00446-020-00376-1openalex-snapshot
Derandomizing local distributed algorithms under bandwidth restrictions
inferred← citeshttps://doi.org/10.1007/s00453-022-00956-6openalex-snapshot
Conflict-Free Coloring Bounds on Open Neighborhoods
inferred← citeshttps://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114808openalex-snapshot
Constant congestion linkages in polynomially strong digraphs in polynomial time
inferred← citeshttps://doi.org/10.1017/s0963548320000127openalex-snapshot
Finding independent transversals efficiently
inferred← citeshttps://doi.org/10.1109/focs.2015.85openalex-snapshot
An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles
inferred← citeshttps://doi.org/10.1109/focs.2019.00049openalex-snapshot
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00011openalex-snapshot
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
inferred← citeshttps://doi.org/10.1109/isit.2015.7282628openalex-snapshot
Global stabilizer quantum error correction with combinatorial arrays
inferred← citeshttps://doi.org/10.1109/isit.2017.8007113openalex-snapshot
Explicit bounds on the length of optimal X-codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518120openalex-snapshot
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1109/tit.2021.3056317openalex-snapshot
Synchronization Strings and Codes for Insertions and Deletions—A Survey
inferred← citeshttps://doi.org/10.1109/tit.2024.3355416openalex-snapshot
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.102openalex-snapshot
Computing the Independence Polynomial: from the Tree Threshold down to the Roots
inferred← citeshttps://doi.org/10.1137/1.9781611977073.71openalex-snapshot
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel
inferred← citeshttps://doi.org/10.1137/20m1351527openalex-snapshot
Counting Solutions to Random CNF Formulas
inferred← citeshttps://doi.org/10.1145/2611462.2611465openalex-snapshot
Distributed algorithms for the Lovász local lemma and graph coloring
inferred← citeshttps://doi.org/10.1145/2818352openalex-snapshot
Random Walks That Find Perfect Objects and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/2897518.2897570openalex-snapshot
A lower bound for the distributed Lovász local lemma
inferred← citeshttps://doi.org/10.1145/3015762openalex-snapshot
Lopsidependency in the Moser-Tardos Framework
inferred← citeshttps://doi.org/10.1145/3147211openalex-snapshot
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
inferred← citeshttps://doi.org/10.1145/3188745.3188928openalex-snapshot
Explicit binary tree codes with polylogarithmic size alphabet
inferred← citeshttps://doi.org/10.1145/3188745.3188940openalex-snapshot
Synchronization strings: explicit constructions, local decoding, and applications
inferred← citeshttps://doi.org/10.1145/3230651openalex-snapshot
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3268930openalex-snapshot
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
inferred← citeshttps://doi.org/10.1145/3468265openalex-snapshot
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
inferred← citeshttps://doi.org/10.1145/3564246.3585183openalex-snapshot
New High Dimensional Expanders from Covers
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.approx-random.2018.44openalex-snapshot
Commutative Algorithms Approximate the LLL-distribution
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.53openalex-snapshot
Counting Solutions to Random CNF Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00343openalex-snapshot
Bicoloring covers for graphs and hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.03160openalex-snapshot
Strong $(r,p)$ Cover for Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.07356openalex-snapshot
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets
inferred← citeshttps://doi.org/10.48550/arxiv.1907.12857openalex-snapshot
Deterministic coloring algorithms in the LOCAL model
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.