On the public citation graph

Fast consensus in networks of bounded degree

https://doi.org/10.1007/bf02280836
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/978-1-4615-3422-8_27openalex-snapshot
Bit Optimal Distributed Consensus
inferredcites →https://doi.org/10.1007/bfb0035753openalex-snapshot
Asymptotically optimal distributed consensus
inferredcites →https://doi.org/10.1007/bfb0040405openalex-snapshot
Families of consensus algorithms
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/0890-5401(92)90004-yopenalex-snapshot
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
inferredcites →https://doi.org/10.1017/cbo9780511662157.006openalex-snapshot
Random graphs
inferredcites →https://doi.org/10.1109/sfcs.1985.41openalex-snapshot
On networks of noisy gates
inferredcites →https://doi.org/10.1109/sfcs.1988.21941openalex-snapshot
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferredcites →https://doi.org/10.1137/0217061openalex-snapshot
Fault Tolerance in Networks of Bounded Degree
inferredcites →https://doi.org/10.1145/12130.12169openalex-snapshot
Fault tolerance in networks of bounded degree
inferredcites →https://doi.org/10.1145/135419.135437openalex-snapshot
Tolerating linear number of faults in networks of bounded degree
inferredcites →https://doi.org/10.1145/2455.214112openalex-snapshot
Bounds on information exchange for Byzantine agreement
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
inferredcites →https://doi.org/10.1145/62212.62225openalex-snapshot
Optimal algorithms for Byzantine agreement
inferredcites →https://doi.org/10.1145/72981.73002openalex-snapshot
Modular construction of nearly optimal Byzantine agreement protocols
inferredcites →https://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_5openalex-snapshot
Synchronous t-Resilient Consensus in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_18openalex-snapshot
Almost-Everywhere Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_9openalex-snapshot
Secure Message Transmission with Small Public Discussion
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_8openalex-snapshot
Secure Message Transmission by Public Discussion: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-24209-0_22openalex-snapshot
Public Discussion Must Be Back and Forth in Secure Message Transmission
inferred← citeshttps://doi.org/10.1007/s00145-023-09460-8openalex-snapshot
Must the Communication Graph of MPC Protocols be an Expander?
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.10.005openalex-snapshot
Distributed agreement in dynamic peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/tit.2014.2307309openalex-snapshot
Secure Message Transmission With Small Public Discussion
inferred← citeshttps://doi.org/10.1137/1.9781611973099.47openalex-snapshot
Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1145/2332432.2332442openalex-snapshot
The cost of fault tolerance in multi-party communication complexity
inferred← citeshttps://doi.org/10.1145/2484239.2484275openalex-snapshot
Fast byzantine agreement in dynamic networks
inferred← citeshttps://doi.org/10.1145/2597633openalex-snapshot
The Cost of Fault Tolerance in Multi-Party Communication Complexity
inferred← citeshttps://doi.org/10.1145/3490148.3538588openalex-snapshot
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables
inferred← citeshttps://doi.org/10.1145/380752.380853openalex-snapshot
The round complexity of verifiable secret sharing and secure multicast
inferred← citeshttps://doi.org/10.5555/2095116.2095163openalex-snapshot
Towards robust and efficient computation in dynamic peer-to-peer networks
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.