On the public citation graph
Randomized consensus in expected O(n2log n) operations
0 signed · 57 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.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/fscs.1990.89524openalex-snapshot
Are wait-free algorithms fast?
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/62546.62593openalex-snapshot
Impossibility and universality results for wait-free synchronization
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/72981.73001openalex-snapshot
Bounded polynomial randomized consensus
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/93385.93433openalex-snapshot
Time-and space-efficient randomized consensus
inferredcites →https://doi.org/10.21236/ada213808openalex-snapshot
Bounded Polynomial Randomized Consensus
inferredcites →https://doi.org/10.5555/127787.127853openalex-snapshot
Optimal time randomized consensus—making resilient algorithms fast in practice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2653openalex-snapshot
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/11795490_6openalex-snapshot
Randomized Wait-Free Consensus Using an Atomicity Assumption
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_1openalex-snapshot
Lower Bounds in Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_25openalex-snapshot
Linear-time snapshot protocols for unbalanced systems
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_164openalex-snapshot
Efficient asynchronous consensus with the value-oblivious adversary scheduler
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_36openalex-snapshot
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_5openalex-snapshot
Communication-Efficient Randomized Consensus
inferred← citeshttps://doi.org/10.1007/bfb0030673openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
inferred← citeshttps://doi.org/10.1007/pl00008917openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
inferred← citeshttps://doi.org/10.1007/s00446-002-0081-5openalex-snapshot
Randomized protocols for asynchronous consensus
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-004-0113-4openalex-snapshot
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
inferred← citeshttps://doi.org/10.1007/s00446-012-0162-zopenalex-snapshot
The correctness proof of Ben-Or’s randomized consensus algorithm
inferred← citeshttps://doi.org/10.1007/s00446-017-0315-1openalex-snapshot
Communication-efficient randomized consensus
inferred← citeshttps://doi.org/10.1007/s11227-022-04774-zopenalex-snapshot
A randomized algorithm for the wait-free consensus problem
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.004openalex-snapshot
Compositional competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.08.005openalex-snapshot
Combining shared-coin algorithms
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00220-1openalex-snapshot
Fast deterministic consensus in a noisy environment
inferred← citeshttps://doi.org/10.1109/icosst.2018.8632190openalex-snapshot
Consensus Algorithms in Blockchain: Comparative Analysis, Challenges and Opportunities
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611973068.49openalex-snapshot
Approximate Shared-Memory Counting Despite a Strong Adversary
inferred← citeshttps://doi.org/10.1137/s0097539790192635openalex-snapshot
Wait-Free Consensus Using Asynchronous Hardware
inferred← citeshttps://doi.org/10.1137/s0097539792240881openalex-snapshot
Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
inferred← citeshttps://doi.org/10.1145/1250790.1250814openalex-snapshot
Tight bounds for asynchronous randomized consensus
inferred← citeshttps://doi.org/10.1145/1400751.1400794openalex-snapshot
Randomized consensus in expected O(n log n) individual work
inferred← citeshttps://doi.org/10.1145/1411509.1411510openalex-snapshot
Tight bounds for asynchronous randomized consensus
inferred← citeshttps://doi.org/10.1145/1583991.1584063openalex-snapshot
Locally scalable randomized consensus for synchronous crash failures
inferred← citeshttps://doi.org/10.1145/1721837.1721841openalex-snapshot
Approximate shared-memory counting despite a strong adversary
inferred← citeshttps://doi.org/10.1145/1810479.1810490openalex-snapshot
Multi-sided shared coins and randomized set-agreement
inferred← citeshttps://doi.org/10.1145/237502.237566openalex-snapshot
Efficient execution of nondeterministic parallel programs on asynchronous systems
inferred← citeshttps://doi.org/10.1145/237814.237869openalex-snapshot
Modular competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1145/248052.248077openalex-snapshot
Spreading rumors rapidly despite an adversary
inferred← citeshttps://doi.org/10.1145/258533.258649openalex-snapshot
Lower bounds for distributed coin-flipping and randomized consensus
inferred← citeshttps://doi.org/10.1145/259380.259441openalex-snapshot
Efficient asynchronous consensus with the weak adversary scheduler
inferred← citeshttps://doi.org/10.1145/2746347openalex-snapshot
Distributed Binary Consensus in Networks with Disturbances
inferred← citeshttps://doi.org/10.1145/278298.278304openalex-snapshot
Lower bounds for distributed coin-flipping and randomized consensus
inferred← citeshttps://doi.org/10.1145/290179.290183openalex-snapshot
On the space complexity of randomized synchronization
inferred← citeshttps://doi.org/10.1145/343477.343631openalex-snapshot
Fast deterministic consensus in a noisy environment
inferred← citeshttps://doi.org/10.1145/509907.509983openalex-snapshot
Wait-free consensus with infinite arrivals
inferred← citeshttps://doi.org/10.4018/978-1-4666-4078-8.ch008openalex-snapshot
Data Mining Algorithms for Measuring Performance Impact of Social Development Processes
inferred← citeshttps://doi.org/10.4018/978-1-59904-657-0openalex-snapshot
Data Mining Applications for Empowering Knowledge Societies
inferred← citeshttps://doi.org/10.48550/arxiv.2010.15210openalex-snapshot
On Linearizability and the Termination of Randomized Algorithms
inferred← citeshttps://doi.org/10.5070/sr33161314openalex-snapshot
[Problem] Cerberus: Minimalistic Multi-shard Byzantine-resilient Transaction Processing
inferred← citeshttps://doi.org/10.5070/sr33161345openalex-snapshot
[Solution] Byzantine Cluster-Sending in Expected Constant Cost and Constant Time
inferred← citeshttps://doi.org/10.5555/1496770.1496819openalex-snapshot
Approximate shared-memory counting despite a strong adversary
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.