On the public citation graph
Algebraic topology and distributed computing a primer
0 signed · 48 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.1016/b978-0-08-016160-0.50028-2openalex-snapshot
ELEMENTS OF ALGEBRAIC TOPOLOGY
inferredcites →https://doi.org/10.1109/sfcs.1993.366866openalex-snapshot
A tight lower bound for k-set agreement
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/195058.195144openalex-snapshot
A simple constructive computability theorem for wait-free computation
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.198126openalex-snapshot
Consensus power makes (some) sense! (extended abstract)
inferredcites →https://doi.org/10.1145/224964.225009openalex-snapshot
3-processor tasks are undecidable
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/62546.62590openalex-snapshot
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor
inferredcites →https://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous environment
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.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-36383-1_10openalex-snapshot
Distributed Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_3openalex-snapshot
Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?
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-48340-3_16openalex-snapshot
New Perspectives in Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_21openalex-snapshot
The combinatorial structure of wait-free solvable tasks
inferred← citeshttps://doi.org/10.1007/bfb0030599openalex-snapshot
Optimal implementation of wait-free binary relations
inferred← citeshttps://doi.org/10.1007/bfb0055632openalex-snapshot
Detecting deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1007/s00200-012-0165-9openalex-snapshot
Execution spaces for simple higher dimensional automata
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-025-00480-0openalex-snapshot
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
inferred← citeshttps://doi.org/10.1007/s004460050068openalex-snapshot
Computable obstructions to wait-free computability
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.022openalex-snapshot
Algebraic topology and concurrency
inferred← citeshttps://doi.org/10.1017/s0960129502003705openalex-snapshot
Investigation of concurrent processes by means of homotopy functors
inferred← citeshttps://doi.org/10.1109/lics.1997.614954openalex-snapshot
Complete cuboidal sets in axiomatic domain theory
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646096openalex-snapshot
Computable obstructions to wait-free computability
inferred← citeshttps://doi.org/10.1145/3519270.3538422openalex-snapshot
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
inferred← citeshttps://doi.org/10.17077/etd.3bk2nxkfopenalex-snapshot
Safety and hazard analysis in concurrent systems
inferred← citeshttps://doi.org/10.2140/agt.2010.10.1683openalex-snapshot
Simplicial models of trace spaces
inferred← citeshttps://doi.org/10.3390/bdcc6010001openalex-snapshot
AGR4BS: A Generic Multi-Agent Organizational Model for Blockchain Systems
inferred← citeshttps://doi.org/10.4310/hha.2003.v5.n2.a6openalex-snapshot
On the geometry of intuitionistic S4 proofs
inferred← citeshttps://doi.org/10.46298/compositionality-6-4openalex-snapshot
Homotopy Theoretic and Categorical Models of Neural Information Networks
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9809019openalex-snapshot
Distributed Computation as Hierarchy
inferred← citeshttps://doi.org/10.70675/aa80e889z0cc4z4358zb7c6z9dc22bf0d1dfopenalex-snapshot
Geometric semantics for asynchronous computability
inferred← citeshttps://doi.org/10.70675/cebdfbb7z17c5z4237zab6czf32ed9c8e178openalex-snapshot
A case study on blockchain vulnerabilities using Multi-Agent Reinforcement Learning
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.