On the public citation graph

Reliable broadcasts and communication models: tradeoffs and lower bounds

https://doi.org/10.1007/bf01872844
0 signed · 36 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.1007/3-540-15216-4_18openalex-snapshot
Paradigms for distributed programs
inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1038/scientificamerican0984-174openalex-snapshot
Computer Software for Process Control
inferredcites →https://doi.org/10.1109/sfcs.1982.51openalex-snapshot
'Eventual' is earlier than 'immediate'
inferredcites →https://doi.org/10.1109/sfcs.1983.48openalex-snapshot
Randomized byzantine generals
inferredcites →https://doi.org/10.1109/tse.1984.5010234openalex-snapshot
Resilient Distributed Computing
inferredcites →https://doi.org/10.1109/tse.1985.232247openalex-snapshot
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1145/29868.31332openalex-snapshot
On the reliability of consensus-based fault-tolerant distributed computing systems
inferredcites →https://doi.org/10.1145/2993.2994openalex-snapshot
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
inferredcites →https://doi.org/10.1145/323596.323603openalex-snapshot
Optimal clock synchronization
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/357980.358015openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/360248.360253openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/5236.5243openalex-snapshot
Applications of Byzantine agreement in database systems
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
inferredcites →https://doi.org/10.1145/800057.808724openalex-snapshot
Efficient fault tolerant routings in networks
inferredcites →https://doi.org/10.1145/800222.806737openalex-snapshot
Byzantine clock synchronization
inferredcites →https://doi.org/10.1145/800222.806739openalex-snapshot
Fault-tolerant clock synchronization
inferredcites →https://doi.org/10.1145/861.866openalex-snapshot
Highly available systems for database applications
inferredcites →https://doi.org/10.1145/861.871openalex-snapshot
Local networks
inferredcites →https://doi.org/10.1145/989.357400openalex-snapshot
Reliable broadcast protocols

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.1995.1060openalex-snapshot
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/bf01088629openalex-snapshot
Replica determinism in distributed real-time systems: A brief survey
inferred← citeshttps://doi.org/10.1007/bf02259749openalex-snapshot
Clock synchronization and the power of broadcasting
inferred← citeshttps://doi.org/10.1007/bf02280837openalex-snapshot
Necessary and sufficient conditions for broadcast consensus protocols
inferred← citeshttps://doi.org/10.1007/bfb0042325openalex-snapshot
Atomic broadcast in a real-time environment
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1023/a:1021753205918openalex-snapshot
Real-Time Atomic Multicast Algorithms Implemented on a Shared Memory Multiprocessor
inferred← citeshttps://doi.org/10.1109/71.372796openalex-snapshot
Byzantine Agreement in a generalized connected network
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558672openalex-snapshot
The Chinese Generals Problem
inferred← citeshttps://doi.org/10.1109/etfa61755.2024.10711081openalex-snapshot
Towards a Node Active Replication Schema for Highly Reliable Distributed Control Systems Based on TSN
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466996openalex-snapshot
Fault tolerance in safety critical automotive applications: cost of agreement as a limiting factor
inferred← citeshttps://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferred← citeshttps://doi.org/10.7907/z94b2zjd.openalex-snapshot
Generalized Network Routing Metrics and Algorithms
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.