On the public citation graph
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
0 signed · 40 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/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/jagm.1993.1022openalex-snapshot
Time- and Space-Efficient Randomized Consensus
inferredcites →https://doi.org/10.1007/3-540-57529-4_72openalex-snapshot
Time optimal self-stabilizing spanning tree algorithms
inferredcites →https://doi.org/10.1007/3-540-58201-0_66openalex-snapshot
Liveness in timed and untimed systems
inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot
Verification of multiprocess probabilistic protocols
inferredcites →https://doi.org/10.1007/bfb0022443openalex-snapshot
Randomized consensus in expected O(n2log n) operations
inferredcites →https://doi.org/10.1007/bfb0030673openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/32.387472openalex-snapshot
Analyzing expected time by scheduler-luck games
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1137/s0097539792240881openalex-snapshot
Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
inferredcites →https://doi.org/10.1145/197917.198117openalex-snapshot
Proving time bounds for randomized distributed algorithms
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferredcites →https://doi.org/10.1145/224964.224984openalex-snapshot
Formal verification of timed properties of randomized distributed algorithms
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/248052.248083openalex-snapshot
Polylog randomized wait-free consensus
inferredcites →https://doi.org/10.1145/259380.259441openalex-snapshot
Efficient asynchronous consensus with the weak adversary scheduler
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_9openalex-snapshot
On the Importance of Having an Identity or, is Consensus really Universal?
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_20openalex-snapshot
Compositional Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_6openalex-snapshot
All k-Bounded Policies Are Equivalent for Self-stabilization
inferred← citeshttps://doi.org/10.1007/s00446-005-0121-zopenalex-snapshot
On the importance of having an identity or, is consensus really universal?
inferred← citeshttps://doi.org/10.1109/dsn.2007.96openalex-snapshot
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
inferred← citeshttps://doi.org/10.1137/1.9781611973082.101openalex-snapshot
Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification
inferred← citeshttps://doi.org/10.1145/290179.290183openalex-snapshot
On the space complexity of randomized synchronization
inferred← citeshttps://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10422openalex-snapshot
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:7)2009openalex-snapshot
Qualitative Logics and Equivalences for Probabilistic Systems
showing the first 12 of 13 · page through all 13
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.