On the public citation graph
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
0 signed · 86 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.1006/jagm.1996.0017openalex-snapshot
On the Complexity of Distributed Network Decomposition
inferredcites →https://doi.org/10.1007/11561071_1openalex-snapshot
Designing Reliable Algorithms in Unreliable Memories
inferredcites →https://doi.org/10.1007/bf02772959openalex-snapshot
Families of finite sets in which no set is covered by the union ofr others
inferredcites →https://doi.org/10.1007/pl00008932openalex-snapshot
Some simple distributed algorithms for sparse networks
inferredcites →https://doi.org/10.1016/0020-0190(86)90144-4openalex-snapshot
A fast and simple randomized parallel algorithm for maximal matching
inferredcites →https://doi.org/10.1016/0022-0000(93)90033-sopenalex-snapshot
Removing randomness in parallel computation without a processor penalty
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.1109/focs.2012.60openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferredcites →https://doi.org/10.1109/ipdps.2001.924926openalex-snapshot
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
inferredcites →https://doi.org/10.1109/ipdps.2006.1639281openalex-snapshot
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
inferredcites →https://doi.org/10.1109/sfcs.1987.20openalex-snapshot
Distributive graph algorithms Global solutions from local data
inferredcites →https://doi.org/10.1109/sfcs.1988.21934openalex-snapshot
Removing randomness in parallel computation without a processor penalty
inferredcites →https://doi.org/10.1109/sfcs.1989.63504openalex-snapshot
Network decomposition and locality in distributed computation
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0401044openalex-snapshot
Parallel Symmetry-Breaking in Sparse Graphs
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/12088848xopenalex-snapshot
Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
inferredcites →https://doi.org/10.1145/1146381.1146387openalex-snapshot
On the complexity of distributed graph coloring
inferredcites →https://doi.org/10.1145/1281100.1281128openalex-snapshot
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
inferredcites →https://doi.org/10.1145/1400751.1400757openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
inferredcites →https://doi.org/10.1145/1536414.1536432openalex-snapshot
Distributed (δ+1)-coloring in linear (in δ) time
inferredcites →https://doi.org/10.1145/1835698.1835797openalex-snapshot
Deterministic distributed vertex coloring in polylogarithmic time
inferredcites →https://doi.org/10.1145/1993806.1993814openalex-snapshot
Toward more localized local algorithms
inferredcites →https://doi.org/10.1145/1993806.1993825openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferredcites →https://doi.org/10.1145/2611462.2611467openalex-snapshot
Linear-in-delta lower bounds in the LOCAL model
inferredcites →https://doi.org/10.48550/arxiv.1110.0367openalex-snapshot
Distributed Maximal Matching: Greedy is Optimal
inferredcites →https://doi.org/10.48550/arxiv.1202.1983openalex-snapshot
The Locality of Distributed Symmetry Breaking
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.5033616openalex-extracted
Locally-Iterative (Δ+1)-Coloring in Sublinear (in Δ) Rounds
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-49190-0_17openalex-snapshot
Self-stabilizing $$(\varDelta +1)$$-Coloring in Sublinear (in $$\varDelta $$) Rounds via Locally-Iterative Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_16openalex-snapshot
Distributed Fractional Local Ratio and Independent Set Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_9openalex-snapshot
Making Local Algorithms Wait-Free: The Case of Ring Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_15openalex-snapshot
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees
inferred← citeshttps://doi.org/10.1007/s00224-017-9772-yopenalex-snapshot
Making Local Algorithms Wait-Free: the Case of Ring Coloring
inferred← citeshttps://doi.org/10.1007/s00446-018-0332-8openalex-snapshot
What can be sampled locally?
inferred← citeshttps://doi.org/10.1007/s00446-020-00375-2openalex-snapshot
Almost global problems in the LOCAL model
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105238openalex-snapshot
Distributed fractional local ratio and independent set approximation
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.028openalex-snapshot
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114744openalex-snapshot
Resource efficient stabilization for local tasks despite unknown capacity links
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115456openalex-snapshot
Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds
inferred← citeshttps://doi.org/10.1109/focs.2019.00037openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00042openalex-snapshot
Distributed Lower Bounds for Ruling Sets
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00101openalex-snapshot
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00082openalex-snapshot
Distributed Symmetry Breaking in Graphs with Bounded Diversity
inferred← citeshttps://doi.org/10.1109/tnet.2017.2751544openalex-snapshot
Fast, Responsive Decentralized Graph Coloring
inferred← citeshttps://doi.org/10.1137/24m1715866openalex-snapshot
Distributed Edge Coloring in Time Polylogarithmic in \({\Delta }\)
inferred← citeshttps://doi.org/10.1145/3188745.3188860openalex-snapshot
New classes of distributed time complexity
inferred← citeshttps://doi.org/10.1145/3209108.3209136openalex-snapshot
Parameterized circuit complexity of model-checking on sparse structures
inferred← citeshttps://doi.org/10.1145/3212734.3212769openalex-snapshot
Locally-Iterative Distributed (Δ+ 1)
inferred← citeshttps://doi.org/10.1145/3288599.3288601openalex-snapshot
Distributed symmetry-breaking with improved vertex-averaged complexity
inferred← citeshttps://doi.org/10.1145/3406325.3451089openalex-snapshot
Efficient randomized distributed coloring in CONGEST
inferred← citeshttps://doi.org/10.1145/3409964.3461804openalex-snapshot
Distributed Graph Coloring Made Easy
inferred← citeshttps://doi.org/10.1145/3461458openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.1145/3486625openalex-snapshot
Locally-iterative Distributed (Δ + 1)-coloring and Applications
inferred← citeshttps://doi.org/10.1145/3519270.3538438openalex-snapshot
Overcoming Congestion in Distributed Coloring
inferred← citeshttps://doi.org/10.1145/3519270.3538440openalex-snapshot
Distributed Edge Coloring in Time Polylogarithmic in Δ
inferred← citeshttps://doi.org/10.1145/3519935.3520023openalex-snapshot
Near-optimal distributed degree+1 coloring
inferred← citeshttps://doi.org/10.1145/3519935.3520027openalex-snapshot
Distributed ∆-coloring plays hide-and-seek
inferred← citeshttps://doi.org/10.1145/3558481.3591095openalex-snapshot
Coloring Fast with Broadcasts
inferred← citeshttps://doi.org/10.1145/3558481.3591319openalex-snapshot
Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications
inferred← citeshttps://doi.org/10.1145/3564246.3585111openalex-snapshot
Improved Dynamic Colouring of Sparse Graphs
inferred← citeshttps://doi.org/10.1145/3583668.3594587openalex-snapshot
Distributed MIS with Low Energy and Time Complexities
inferred← citeshttps://doi.org/10.1145/3583668.3594594openalex-snapshot
Optimal Message-Passing with Noisy Beeps
inferred← citeshttps://doi.org/10.1145/3662158.3662798openalex-snapshot
Tight Lower Bounds in the Supported LOCAL Model
inferred← citeshttps://doi.org/10.1145/3732772.3733549openalex-snapshot
Decentralized Distributed Graph Coloring: Cluster Graphs
inferred← citeshttps://doi.org/10.1145/3732772.3733565openalex-snapshot
Towards Optimal Deterministic LOCAL Algorithms on Trees
inferred← citeshttps://doi.org/10.1145/3819817openalex-snapshot
Distributed Δ-Coloring Plays Hide-and-Seek
inferred← citeshttps://doi.org/10.3390/a18050280openalex-snapshot
A Local 6-Approximation Distributed Algorithm for Minimum Dominating Set Problem in Planar Triangle-Free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.11openalex-snapshot
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.18openalex-snapshot
Improved Distributed Fractional Coloring Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2023.11openalex-snapshot
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2023.13openalex-snapshot
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)
inferred← citeshttps://doi.org/10.48550/arxiv.1702.00142openalex-snapshot
What can be sampled locally?
inferred← citeshttps://doi.org/10.48550/arxiv.1708.06275openalex-snapshot
Simple and Near-Optimal Distributed Coloring for Sparse Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1712.00285openalex-snapshot
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03488openalex-snapshot
Parameterized circuit complexity of model checking first-order logic on sparse structures
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.