On the public citation graph

Making distributed spanning tree algorithms fault-resilient

https://doi.org/10.1007/bfb0039625
0 signed · 32 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-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1109/tc.1982.1675885openalex-snapshot
Elections in a Distributed Computing System
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/323596.323602openalex-snapshot
Easy impossibility proofs for distributed consensus problems
inferredcites →https://doi.org/10.1145/323596.323611openalex-snapshot
A modular technique for the design of efficient distributed leader finding algorithms
inferredcites →https://doi.org/10.1145/323596.323613openalex-snapshot
Time and message bounds for election in synchronous and asynchronous complete networks
inferredcites →https://doi.org/10.1145/357084.357087openalex-snapshot
Distributed Termination
inferredcites →https://doi.org/10.1145/357103.357113openalex-snapshot
Corrigendum: “Distributed Termination”
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/359024.359029openalex-snapshot
Decentralized extrema-finding in circular configurations of processors
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/800222.806741openalex-snapshot
Elections in the presence of faults
inferredcites →https://doi.org/10.1145/800222.806747openalex-snapshot
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
inferredcites →https://doi.org/10.21236/ada146581openalex-snapshot
Selecting a Leader in a Clique in O(N log N) Messages

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-51687-5_41openalex-snapshot
Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_48openalex-snapshot
Possibility and impossibility results in a shared memory environment
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_169openalex-snapshot
Distributed computing in asynchronous networks with byzantine edges
inferred← citeshttps://doi.org/10.1007/bf01407859openalex-snapshot
Initial failures in distributed computations
inferred← citeshttps://doi.org/10.1007/bfb0019816openalex-snapshot
Fault-tolerant distributed algorithm for election in complete networks
inferred← citeshttps://doi.org/10.1007/s002360050034openalex-snapshot
Possibility and impossibility results in a shared memory environment
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90183-xopenalex-snapshot
Leader election in the presence of n−1 initial failures
inferred← citeshttps://doi.org/10.1109/12.2189openalex-snapshot
Fault-tolerant distributed algorithm for election in complete networks
inferred← citeshttps://doi.org/10.1109/12.293257openalex-snapshot
Election in asynchronous complete networks with intermittent link failures
inferred← citeshttps://doi.org/10.1109/32.54293openalex-snapshot
Optimal distributed t-resilient election in complete networks
inferred← citeshttps://doi.org/10.1109/71.491576openalex-snapshot
Leader election in the presence of link failures
inferred← citeshttps://doi.org/10.1109/iscas.1988.14987openalex-snapshot
Distributed algorithms in faulty networks
inferred← citeshttps://doi.org/10.1109/reldis.1991.145424openalex-snapshot
Keeping processes under surveillance
inferred← citeshttps://doi.org/10.1137/s0097539796312745openalex-snapshot
Early Detection of Message Forwarding Faults
inferred← citeshttps://doi.org/10.1145/135419.135457openalex-snapshot
Leader election in complete networks
inferred← citeshttps://doi.org/10.1145/197917.198134openalex-snapshot
Leader election in the presence of link failures (abstract)
inferred← citeshttps://doi.org/10.1145/72981.73006openalex-snapshot
Fast isolation of arbitrary forwarding faults
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.