On the public citation graph

Randomized two-process wait-free test-and-set

https://doi.org/10.1007/s004460200071

0 signed · 50 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.1006/jagm.1993.1022openalex-snapshot

Time- and Space-Efficient Randomized Consensus

inferredcites →https://doi.org/10.1007/3-540-40026-5_9openalex-snapshot

On the Importance of Having an Identity or, is Consensus really Universal?

inferredcites →https://doi.org/10.1007/3-540-56188-9_6openalex-snapshot

Wait-free test-and-set

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

The choice coordination problem

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

A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment

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

Bounded time-stamps

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

Multi-writer composite registers

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

Distributed Algorithms

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

Long-lived, fast, waitfree renaming with optimal name space and high throughput

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

Randomized naming using wait-free shared variables

inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot

Fast randomized consensus using shared memory

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

Atomic shared register access by asynchronous hardware

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

Wait-Free Consensus Using Asynchronous Hardware

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

Bounded Concurrent Time-Stamping

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

Randomized wait-free concurrent objects (extended abstract)

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

Wait-free synchronization

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

Atomic snapshots of shared memory

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

Immediate atomic snapshots and fast renaming

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

The elusive atomic register

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

How to share concurrent wait-free variables

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

Impossibility of distributed consensus with one faulty process

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

Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable

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

An Introduction to Input/Output Automata

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

The elusive atomic register revisited

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

Bounded concurrent timestamp systems using vector clocks

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

On achieving consensus using a shared memory

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

Sticky bits and universality of consensus

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

Bounded polynomial randomized consensus

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

Bounded concurrrent time-stamp systems are constructible

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

Linearizability: a correctness condition for concurrent objects

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

Economical solutions for the critical section problem in a distributed system (Extended Abstract)

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.1007/978-3-319-14472-6_27openalex-snapshot

Space- and Time-Efficient Long-Lived Test-And-Set Objects

inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_9openalex-snapshot

Fast Randomized Test-and-Set and Renaming

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_7openalex-snapshot

Sub-logarithmic Test-and-Set against a Weak Adversary

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_4openalex-snapshot

An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election

inferred← citeshttps://doi.org/10.1007/s00446-019-00349-zopenalex-snapshot

Efficient randomized test-and-set implementations

inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.07.002openalex-snapshot

Implementing sequentially consistent programs on processor consistent platforms

inferred← citeshttps://doi.org/10.1109/ispan.2004.1300500openalex-snapshot

Implementing sequentially consistent programs on processor consistent platforms

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

Optimal-time adaptive strong renaming, with applications to counting

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

On the time and space complexity of randomized test-and-set

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

Tight Bounds for Asynchronous Renaming

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

Test-and-Set in Optimal Space

inferred← citeshttps://doi.org/10.18745/th.17110openalex-snapshot

Fault Tolerance for Stream Programs on Parallel Platforms

inferred← citeshttps://doi.org/10.48550/arxiv.1608.06033openalex-snapshot

Deterministic and Fast Randomized Test-and-Set in Optimal Space

inferred← citeshttps://doi.org/10.48550/arxiv.1902.04002openalex-snapshot

Efficient Randomized Test-And-Set Implementations

inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot

Notes on Theory of Distributed Systems

inferred← citeshttps://doi.org/10.5075/epfl-thesis-5447openalex-snapshot

Randomized versus Deterministic Implementations of Concurrent Data Structures

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.