On the public citation graph

Naming symmetric processes using shared variables

https://doi.org/10.1007/bf02283568
0 signed · 52 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/inco.1994.1065openalex-snapshot
Calling Names on Nameless Networks
inferredcites →https://doi.org/10.1007/3-540-51687-5_42openalex-snapshot
Simple and efficient election algorithms for anonymous networks
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf00288965openalex-snapshot
The choice coordination problem
inferredcites →https://doi.org/10.1007/bf00289519openalex-snapshot
Hierarchical ordering of sequential processes
inferredcites →https://doi.org/10.1007/bf01558664openalex-snapshot
Choice coordination with limited failure
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1016/0020-0190(90)90094-eopenalex-snapshot
Space efficient processor identity protocol
inferredcites →https://doi.org/10.1016/0020-0190(90)90103-5openalex-snapshot
The processor identity problem
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1016/0890-5401(90)90004-2openalex-snapshot
Symmetry breaking in distributed networks
inferredcites →https://doi.org/10.1109/istcs.1993.253474openalex-snapshot
The Las-Vegas processor identity problem (how and when to be unique)
inferredcites →https://doi.org/10.1109/sfcs.1981.41openalex-snapshot
Symmetry breaking in distributive networks
inferredcites →https://doi.org/10.1109/sfcs.1981.42openalex-snapshot
Symmetry in systems of asynchronous processes
inferredcites →https://doi.org/10.1109/sfcs.1987.5openalex-snapshot
Achievable cases in an asynchronous environment
inferredcites →https://doi.org/10.1109/spdp.1990.143625openalex-snapshot
Solving the processor identity problem in O(n) space
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/1780.1804openalex-snapshot
The drinking philosophers problem
inferredcites →https://doi.org/10.1145/323596.323598openalex-snapshot
Symmetry and similarity in distributed systems
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/62546.62568openalex-snapshot
Computing on an anonymous network
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/72935.72954openalex-snapshot
The APRAM: incorporating asynchrony into the PRAM model
inferredcites →https://doi.org/10.1145/72981.73001openalex-snapshot
Bounded polynomial randomized consensus
inferredcites →https://doi.org/10.1145/72981.73004openalex-snapshot
Calling names in nameless networks
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
inferredcites →https://doi.org/10.1145/93385.93394openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/93385.93396openalex-snapshot
Composite registers
inferredcites →https://doi.org/10.21236/ada222765openalex-snapshot
Atomic Snapshots of Shared Memory

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.2000.1110openalex-snapshot
The Las-Vegas Processor Identity Problem (How and When to Be Unique)
inferred← citeshttps://doi.org/10.1007/11561927_19openalex-snapshot
What Can Be Implemented Anonymously?
inferred← citeshttps://doi.org/10.1007/11795490_30openalex-snapshot
On the Power of Anonymous One-Way Communication
inferred← citeshttps://doi.org/10.1007/978-3-030-39442-4_29openalex-snapshot
Naming Anonymous Processes Using an Optimal Number of Test-and-Set Registers
inferred← citeshttps://doi.org/10.1007/978-3-030-63089-8_10openalex-snapshot
Performance of Test-and-Set Algorithms for Naming Anonymous Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-80119-9_5openalex-snapshot
Naming Processes in Multichannels with Beeps in the Weak Model
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_19openalex-snapshot
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_28openalex-snapshot
The Anonymous Consensus Hierarchy and Naming Problems
inferred← citeshttps://doi.org/10.1007/s00446-005-0145-4openalex-snapshot
Relationships between broadcast and shared memory in reliable anonymous distributed systems
inferred← citeshttps://doi.org/10.1007/s00446-007-0040-2openalex-snapshot
The computational power of population protocols
inferred← citeshttps://doi.org/10.1007/s00446-007-0042-0openalex-snapshot
Anonymous and fault-tolerant shared-memory computing
inferred← citeshttps://doi.org/10.1007/s004460050045openalex-snapshot
Randomized naming using wait-free shared variables
inferred← citeshttps://doi.org/10.1007/s446-002-8029-yopenalex-snapshot
Torus orientation
inferred← citeshttps://doi.org/10.1109/istcs.1993.253474openalex-snapshot
The Las-Vegas processor identity problem (how and when to be unique)
inferred← citeshttps://doi.org/10.20868/upm.thesis.38766openalex-snapshot
Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures
inferred← citeshttps://doi.org/10.3390/app10207164openalex-snapshot
Naming in Multichannel with Beeps in the Strong Model
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.