On the public citation graph

Tight Analysis of Parallel Randomized Greedy MIS

0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.3240010104openalex-snapshot
Probabilistic analysis of a parallel algorithm for finding maximal independent sets
inferredcites →https://doi.org/10.1002/rsa.3240030210openalex-snapshot
On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph
inferredcites →https://doi.org/10.1007/978-3-642-11476-2_25openalex-snapshot
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)
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.1023/b:mach.0000033116.57574.95openalex-snapshot
Correlation Clustering
inferredcites →https://doi.org/10.1109/focs.2012.60openalex-snapshot
The Locality of Distributed Symmetry Breaking
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.1987.46openalex-snapshot
Parallel graph algorithms that are efficient on average
inferredcites →https://doi.org/10.1137/0218029openalex-snapshot
A New 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/0402028openalex-snapshot
Constructing a Maximal Independent Set in Parallel
inferredcites →https://doi.org/10.1137/1.9781611974331.ch20openalex-snapshot
An Improved Distributed Algorithm for Maximal Independent Set
inferredcites →https://doi.org/10.1145/1411509.1411513openalex-snapshot
Aggregating inconsistent information
inferredcites →https://doi.org/10.1145/2145816.2145840openalex-snapshot
Internally deterministic parallel algorithms can be fast
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/2312005.2312058openalex-snapshot
Greedy sequential maximal independent set and matching are parallel on average
inferredcites →https://doi.org/10.1145/2370036.2145840openalex-snapshot
Internally deterministic parallel algorithms can be fast
inferredcites →https://doi.org/10.1145/2623330.2623743openalex-snapshot
Correlation clustering in MapReduce
inferredcites →https://doi.org/10.1145/28395.28429openalex-snapshot
Parallel symmetry-breaking in sparse graphs
inferredcites →https://doi.org/10.1145/2903137openalex-snapshot
The Locality of Distributed Symmetry Breaking
inferredcites →https://doi.org/10.1145/358141.358144openalex-snapshot
An overview of computational complexity
inferredcites →https://doi.org/10.1145/4221.4226openalex-snapshot
A fast parallel algorithm for the maximal independent set problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/focs52979.2021.00089openalex-snapshot
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00074openalex-snapshot
Almost 3-Approximate Correlation Clustering in Constant Rounds
inferred← citeshttps://doi.org/10.1109/ispdc69862.2026.00020openalex-snapshot
Distributed Maximal Independent Set Computation in Hundred Billion-Edge Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch151openalex-snapshot
Beating Greedy Matching in Sublinear Time
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch179openalex-snapshot
Query Complexity of the Metric Steiner Tree Problem
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3212734.3212756openalex-snapshot
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3392035openalex-snapshot
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma
inferred← citeshttps://doi.org/10.1145/3490148.3538574openalex-snapshot
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
inferred← citeshttps://doi.org/10.1145/3558481.3591082openalex-snapshot
Provably-Efficient and Internally-Deterministic Parallel Union-Find
inferred← citeshttps://doi.org/10.1145/3694906.3743313openalex-snapshot
Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
inferred← citeshttps://doi.org/10.1177/10943420241304759openalex-snapshot
Coarsening and parallelism with reduction multigrids for hyperbolic Boltzmann transport
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12310openalex-snapshot
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
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.