On the public citation graph

Anomalies in the wait-free hierarchy

https://doi.org/10.1007/bfb0020431
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.1007/bfb0020427openalex-snapshot
Exotic behaviour of consensus numbers
inferredcites →https://doi.org/10.1109/fscs.1990.89524openalex-snapshot
Are wait-free algorithms fast?
inferredcites →https://doi.org/10.1109/sfcs.1993.366867openalex-snapshot
Synchronization power depends on the register size
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.1145/164051.164069openalex-snapshot
Resource bounds and combinations of consensus objects
inferredcites →https://doi.org/10.1145/164051.164070openalex-snapshot
On the robustness of Herlihy's hierarchy
inferredcites →https://doi.org/10.1145/164051.164071openalex-snapshot
A completeness theorem for a class of synchronization objects
inferredcites →https://doi.org/10.1145/167088.167119openalex-snapshot
Generalized FLP impossibility result for t -resilient asynchronous computations
inferredcites →https://doi.org/10.1145/167088.167122openalex-snapshot
Wait-free k -set agreement is impossible
inferredcites →https://doi.org/10.1145/167088.167125openalex-snapshot
The asynchronous computability theorem for t -resilient tasks
inferredcites →https://doi.org/10.1145/197917.198123openalex-snapshot
A gap theorem for consensus types extended abstract
inferredcites →https://doi.org/10.1145/197917.198126openalex-snapshot
Consensus power makes (some) sense! (extended abstract)
inferredcites →https://doi.org/10.1145/197917.198176openalex-snapshot
Set-linearizability
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/93385.93431openalex-snapshot
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
inferredcites →https://doi.org/10.1145/97444.97701openalex-snapshot
Wait-free data structures in the asynchronous PRAM model
inferredcites →https://doi.org/10.21236/ada264351openalex-snapshot
On the Robustness of Herlihy's Hierarchy

What points at this work

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

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-61769-8_22openalex-snapshot
On the robustness of h m r
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_20openalex-snapshot
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects
inferred← citeshttps://doi.org/10.1007/bfb0020419openalex-snapshot
Distributed Algorithms: 8th International Workshop, Wdag'1994 Terschelling, the Netherlands September 29-October 1, 1994 : Proceedings
inferred← citeshttps://doi.org/10.1007/bfb0022136openalex-snapshot
Wait-free computing
inferred← citeshttps://doi.org/10.1007/bfb0056482openalex-snapshot
A wait-free classification of loop agreement tasks
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-020-00372-5openalex-snapshot
Life beyond set agreement
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.004openalex-snapshot
On the viability of the deterministic consensus hierarchy
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00396-6openalex-snapshot
A classification of wait-free loop agreement tasks
inferred← citeshttps://doi.org/10.1137/s0097539798335766openalex-snapshot
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
inferred← citeshttps://doi.org/10.1145/224964.224977openalex-snapshot
More on t-resilience vs. wait-freedom (extended abstract)
inferred← citeshttps://doi.org/10.1145/263867.263888openalex-snapshot
Robust wait-free hierarchies
inferred← citeshttps://doi.org/10.1145/2789149.2789164openalex-snapshot
A Quarter-Century of Wait-Free Synchronization
inferred← citeshttps://doi.org/10.1145/2933057.2933116openalex-snapshot
Deterministic Objects
inferred← citeshttps://doi.org/10.1145/3087801.3087822openalex-snapshot
Life Beyond Set Agreement
inferred← citeshttps://doi.org/10.1145/383962.383979openalex-snapshot
On beyond registers
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.