On the public citation graph

Wait-free computing

0 signed · 54 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/3-540-56188-9_5openalex-snapshot

Some results on the impossibility, universality, and decidability of consensus

inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot

On interprocess communication

inferredcites →https://doi.org/10.1007/bfb0020431openalex-snapshot

Anomalies in the wait-free hierarchy

inferredcites →https://doi.org/10.1016/0020-0190(88)90175-5openalex-snapshot

Converting Lamport's regular register to atomic register

inferredcites →https://doi.org/10.1016/0196-6774(90)90020-fopenalex-snapshot

A combinatorial characterization of the distributed 1-solvable tasks

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot

Atomic shared register access by asynchronous hardware

inferredcites →https://doi.org/10.1109/sfcs.1987.15openalex-snapshot

Concurrent reading while writing II: The multi-writer case

inferredcites →https://doi.org/10.1137/s0097539795280081openalex-snapshot

Solvability of Consensus: Composition Breaks Down for NonDeterministic Types

inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot

Algorithms for scalable synchronization on shared-memory multiprocessors

inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot

Wait-free synchronization

inferredcites →https://doi.org/10.1145/135419.135435openalex-snapshot

Optimal multi-writer multi-reader atomic register

inferredcites →https://doi.org/10.1145/161468.161469openalex-snapshot

A methodology for implementing highly concurrent data objects

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/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.198119openalex-snapshot

Set consensus using arbitrary objects (preliminary version)

inferredcites →https://doi.org/10.1145/197917.198121openalex-snapshot

Wait-freedom vs. t -resiliency and the robustness of wait-free hierarchies (extended abstract)

inferredcites →https://doi.org/10.1145/197917.198123openalex-snapshot

A gap theorem for consensus types extended abstract

inferredcites →https://doi.org/10.1145/197917.198124openalex-snapshot

On the use of registers in achieving wait-free consensus

inferredcites →https://doi.org/10.1145/197917.198126openalex-snapshot

Consensus power makes (some) sense! (extended abstract)

inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot

Sharing memory robustly in message-passing systems

inferredcites →https://doi.org/10.1145/224964.224977openalex-snapshot

More on t-resilience vs. wait-freedom (extended abstract)

inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot

Impossibility of distributed consensus with one faulty process

inferredcites →https://doi.org/10.1145/331524.331529openalex-snapshot

The topological structure of asynchronous computability

inferredcites →https://doi.org/10.1145/357195.357198openalex-snapshot

Concurrent Reading While Writing

inferredcites →https://doi.org/10.1145/357195.357199openalex-snapshot

A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables

inferredcites →https://doi.org/10.1145/359863.359878openalex-snapshot

Concurrent reading and writing

inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot

Concurrent control with “readers” and “writers”

inferredcites →https://doi.org/10.1145/3788687openalex-snapshot

An Introduction to Input/Output Automata

inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot

On processor coordination using asynchronous hardware

inferredcites →https://doi.org/10.1145/41840.41858openalex-snapshot

The elusive atomic register revisited

inferredcites →https://doi.org/10.1145/41840.41860openalex-snapshot

A protocol for wait-free, atomic, multi-reader shared variables

inferredcites →https://doi.org/10.1145/41840.41861openalex-snapshot

Constructing two-writer atomic registers

inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot

On the minimal synchronism needed for distributed consensus

inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot

Linearizability: a correctness condition for concurrent objects

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/99163.99185openalex-snapshot

A methodology for implementing highly concurrent data structures

inferredcites →https://doi.org/10.1145/99164.99185openalex-snapshot

A methodology for implementing highly concurrent data structures

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-36108-1_16openalex-snapshot

Failure Detection Lower Bounds on Registers and Consensus

inferred← citeshttps://doi.org/10.1007/3-540-46432-8_18openalex-snapshot

Sequential and Concurrent Abstract Machines for Interaction Nets

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-540-30186-8_11openalex-snapshot

Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS

inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_21openalex-snapshot

On Failure Detectors and Type Boosters

inferred← citeshttps://doi.org/10.1007/pl00008920openalex-snapshot

On the power of shared object types to implement one-resilient Consensus

inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot

Hundreds of impossibility results for distributed computing

inferred← citeshttps://doi.org/10.1016/j.jcss.2007.10.002openalex-snapshot

The gap in circumventing the impossibility of consensus

inferred← citeshttps://doi.org/10.1109/isorc.2002.1003807openalex-snapshot

Wait-free objects for real-time systems?

inferred← citeshttps://doi.org/10.1145/259380.259427openalex-snapshot

Determining consensus numbers

inferred← citeshttps://doi.org/10.1145/259380.259428openalex-snapshot

On the power of shared object types to implement one-resilient Consensus

inferred← citeshttps://doi.org/10.1145/263867.263888openalex-snapshot

Robust wait-free hierarchies

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.