On the public citation graph
Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
0 signed · 80 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(199705)10:3<385::aid-rsa6>3.0.co;2-sopenalex-snapshot
Nearly optimal distributed edge coloring in O(log log n) rounds
inferredcites →https://doi.org/10.1006/jagm.1996.0017openalex-snapshot
On the Complexity of Distributed Network Decomposition
inferredcites →https://doi.org/10.1007/3-540-60313-1_162openalex-snapshot
Near-optimal distributed edge coloring
inferredcites →https://doi.org/10.1007/s004460050033openalex-snapshot
Efficient leader election using sense of direction
inferredcites →https://doi.org/10.1007/s00453-004-1104-3openalex-snapshot
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms
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(88)90006-5openalex-snapshot
A fast parallel algorithm to color a graph with Δ colors
inferredcites →https://doi.org/10.1016/s0020-0190(97)00091-4openalex-snapshot
On the impact of sense of direction on message complexity
inferredcites →https://doi.org/10.1016/s0020-0190(99)00064-2openalex-snapshot
Simple distributed Δ+1-coloring of graphs
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/ccc.1996.507690openalex-snapshot
Zero knowledge and the chromatic number
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1145/1073970.1073987openalex-snapshot
Constant density spanners for wireless ad-hoc networks
inferredcites →https://doi.org/10.1145/1073970.1074023openalex-snapshot
Adversarial contention resolution for simple channels
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/129712.129770openalex-snapshot
Efficient fault tolerant algorithms for resource allocation in distributed systems
inferredcites →https://doi.org/10.1145/135419.135465openalex-snapshot
Fast randomized algorithms for distributed edge coloring
inferredcites →https://doi.org/10.1145/22145.22146openalex-snapshot
A simple parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/4221.4226openalex-snapshot
A fast parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1145/777412.777469openalex-snapshot
Can we elect if we cannot compare?
inferredcites →https://doi.org/10.5555/545381.545461openalex-snapshot
Experimental analysis of simple, distributed vertex coloring algorithms
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-86637-1_41openalex-snapshot
Minimum Dominating Set and Minimum Connected Dominating Set Construction in Wireless Sensor Networks Under the Sleeping Model
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_21openalex-snapshot
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_5openalex-snapshot
On the Microscopic View of Time and Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_22openalex-snapshot
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_51openalex-snapshot
Colouring Non-sparse Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_2openalex-snapshot
Local Algorithms: Self-stabilization on Speed
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_28openalex-snapshot
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_25openalex-snapshot
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_15openalex-snapshot
Deploying Wireless Networks with Beeps
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_4openalex-snapshot
Trading Bit, Message, and Time Complexity of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_5openalex-snapshot
Combinatorial Algorithms for Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_14openalex-snapshot
“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_31openalex-snapshot
Distributed Algorithms for Coloring Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-981-13-9409-6_76openalex-snapshot
Self-generating Topology Coloring Scheduling for Interference Mitigation in Wireless Body Area Networks
inferred← citeshttps://doi.org/10.1007/s00446-008-0076-yopenalex-snapshot
Distributed computing with advice: information sensitivity of graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-009-0088-2openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
inferred← citeshttps://doi.org/10.1007/s00446-010-0121-5openalex-snapshot
An optimal bit complexity randomized distributed MIS algorithm
inferred← citeshttps://doi.org/10.1007/s00446-012-0167-7openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferred← citeshttps://doi.org/10.1007/s00446-013-0203-2openalex-snapshot
Combinatorial algorithms for distributed graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
inferred← citeshttps://doi.org/10.1007/s00453-018-0517-3openalex-snapshot
Deterministic Leader Election Takes $$\Theta (D + \log n)$$ Θ ( D + log n ) Bit Rounds
inferred← citeshttps://doi.org/10.1007/s11227-015-1540-7openalex-snapshot
Coloring-based scheduling for interactive game application with wireless body area networks
inferred← citeshttps://doi.org/10.1016/j.ic.2010.07.001openalex-snapshot
About randomised distributed graph colouring and graph partition algorithms
inferred← citeshttps://doi.org/10.1016/j.ic.2013.10.005openalex-snapshot
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.004openalex-snapshot
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter…
inferred← citeshttps://doi.org/10.1016/j.ic.2016.09.006openalex-snapshot
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(logn) bit rounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.028openalex-snapshot
On the time and the bit complexity of distributed randomised anonymous ring colouring
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.037openalex-snapshot
Distributed algorithms for random graphs
inferred← citeshttps://doi.org/10.1049/iet-net.2018.5204openalex-snapshot
DIAMOND: a distributed algorithm for vertex coloring problems and resource allocation
inferred← citeshttps://doi.org/10.1109/aina.2010.98openalex-snapshot
The Power of Orientation in Symmetry-Breaking
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4808997openalex-snapshot
Experimental Analysis of Distributed Coloring Algorithms
inferred← citeshttps://doi.org/10.1109/icdcs.2010.35openalex-snapshot
Distributed Node Coloring in the SINR Model
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00082openalex-snapshot
Distributed Symmetry Breaking in Graphs with Bounded Diversity
inferred← citeshttps://doi.org/10.1109/isit.2010.5513279openalex-snapshot
Distributed consensus with finite messaging
inferred← citeshttps://doi.org/10.1109/tnet.2014.2365440openalex-snapshot
Leveraging Physical-Layer Capabilites: Distributed Scheduling in Interference Networks With Local Views
inferred← citeshttps://doi.org/10.1109/tpds.2012.133openalex-snapshot
Coloring-Based Inter-WBAN Scheduling for Mobile Wireless Body Area Networks
inferred← citeshttps://doi.org/10.1145/1400751.1400757openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
inferred← citeshttps://doi.org/10.1145/1835698.1835760openalex-snapshot
A new technique for distributed symmetry breaking
inferred← citeshttps://doi.org/10.1145/1835698.1835797openalex-snapshot
Deterministic distributed vertex coloring in polylogarithmic time
inferred← citeshttps://doi.org/10.1145/1993806.1993812openalex-snapshot
Distributed graph coloring in a few rounds
inferred← citeshttps://doi.org/10.1145/1993806.1993825openalex-snapshot
Distributed deterministic edge coloring using bounded neighborhood independence
inferred← citeshttps://doi.org/10.1145/2027216.2027221openalex-snapshot
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
inferred← citeshttps://doi.org/10.1145/2484239.2484244openalex-snapshot
Stone age distributed computing
inferred← citeshttps://doi.org/10.1145/2629493openalex-snapshot
Deterministic and Energy-Optimal Wireless Synchronization
inferred← citeshttps://doi.org/10.1145/2767386.2767410openalex-snapshot
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks
inferred← citeshttps://doi.org/10.1145/2897518.2897533openalex-snapshot
Distributed (∆+1)-coloring in sublogarithmic rounds
inferred← citeshttps://doi.org/10.1145/2903137openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferred← citeshttps://doi.org/10.1145/2979675openalex-snapshot
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
inferred← citeshttps://doi.org/10.1145/3178120openalex-snapshot
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
inferred← citeshttps://doi.org/10.1145/3323165.3323195openalex-snapshot
Distributed Computation in Node-Capacitated Networks
inferred← citeshttps://doi.org/10.1145/3382734.3404504openalex-snapshot
Efficient Deterministic Distributed Coloring with Small Bandwidth
inferred← citeshttps://doi.org/10.1145/3406325.3451089openalex-snapshot
Efficient randomized distributed coloring in CONGEST
inferred← citeshttps://doi.org/10.2200/s00520ed1v01y201307dct011openalex-snapshot
Distributed Graph Coloring: Fundamentals and Recent Developments
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1983openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferred← citeshttps://doi.org/10.48550/arxiv.2105.09756openalex-snapshot
Fully Adaptive Self-Stabilizing Transformer for LCL Problems
inferred← citeshttps://doi.org/10.5121/ijcnc.2013.5213openalex-snapshot
Performance Evaluation of Distributed Synchronous Greedy Graph Coloring Algorithms on Wireless Ad Hoc and Sensor Networks
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.