On the public citation graph

Distributed computing on transitive networks: The torus

0 signed · 27 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/bfb0040400openalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1109/sfcs.1987.60openalex-snapshot
Two lower bounds in asynchronous distributed computation
inferredcites →https://doi.org/10.1145/10590.10602openalex-snapshot
Gap theorems for distributed computing
inferredcites →https://doi.org/10.1145/323596.323614openalex-snapshot
Computing on an anonymous ring

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1994.1002openalex-snapshot
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
inferred← citeshttps://doi.org/10.1006/jagm.1996.0817openalex-snapshot
Distributed Computing on Anonymous Hypercube Networks
inferred← citeshttps://doi.org/10.1007/11940128_73openalex-snapshot
Effective Elections for Anonymous Mobile Agents
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_6openalex-snapshot
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_17openalex-snapshot
Distributed computing on anonymous hypercubes with faulty components
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_41openalex-snapshot
Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_145openalex-snapshot
String recognition on anonymous rings
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02679446openalex-snapshot
Wang Tilings and Distributed Verification on Anonymous Torus Networks
inferred← citeshttps://doi.org/10.1007/bfb0032037openalex-snapshot
Computing boolean functions on anonymous networks
inferred← citeshttps://doi.org/10.1007/pl00008936openalex-snapshot
Distributed computing on oriented anonymous hypercubes with faulty components
inferred← citeshttps://doi.org/10.1007/s002240000081openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/s002240010007openalex-snapshot
On Recognizing a String on an Anonymous Ring
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00197-2openalex-snapshot
A gap theorem for the anonymous torus
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00031-8openalex-snapshot
Minimal sense of direction in regular networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00592-3openalex-snapshot
Computing on anonymous networks with sense of direction
inferred← citeshttps://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferred← citeshttps://doi.org/10.1109/spdp.1991.218191openalex-snapshot
Distributed computing on anonymous hypercube networks
inferred← citeshttps://doi.org/10.1109/spdp.1992.242740openalex-snapshot
Distributed computing on Cayley networks
inferred← citeshttps://doi.org/10.1137/0222028openalex-snapshot
Gap Theorems for Distributed Computation
inferred← citeshttps://doi.org/10.1145/301308.301357openalex-snapshot
Backward consistency and sense of direction in advanced distributed systems
inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot
Using mobile agents for black hole search with tokens in multi networks
inferred← citeshttps://doi.org/10.2478/v10179-012-0006-3openalex-snapshot
Representation of direct product of permutation groups as symmetry groups of boolean functions
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.