On the public citation graph
The Weighted Byzantine Agreement Problem
0 signed · 38 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.1007/bfb0035753openalex-snapshot
Asymptotically optimal distributed consensus
inferredcites →https://doi.org/10.1007/bfb0056479openalex-snapshot
Efficient Byzantine agreement secure against general adversaries
inferredcites →https://doi.org/10.1016/j.ins.2007.04.011openalex-snapshot
Performance study of Byzantine Agreement Protocol with artificial neural network
inferredcites →https://doi.org/10.1109/icoin.2001.905500openalex-snapshot
A new approach for byzantine agreement
inferredcites →https://doi.org/10.1109/sfcs.1989.63511openalex-snapshot
Towards optimal distributed consensus
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1137/s0097539790187084openalex-snapshot
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
inferredcites →https://doi.org/10.1145/1146381.1146393openalex-snapshot
Distributed computing meets game theory
inferredcites →https://doi.org/10.1145/167088.167101openalex-snapshot
Fully polynomial Byzantine agreement in t + 1 rounds
inferredcites →https://doi.org/10.1145/1835698.1835798openalex-snapshot
Breaking the O ( n 2 ) bit barrier
inferredcites →https://doi.org/10.1145/22145.22180openalex-snapshot
An O(lg n) expected rounds randomized Byzantine generals protocol
inferredcites →https://doi.org/10.1145/259380.259412openalex-snapshot
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
inferredcites →https://doi.org/10.1145/31846.42229openalex-snapshot
An O (log n ) expected rounds randomized byzantine generals protocol
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/3335772.3335936openalex-snapshot
The Byzantine generals problem
inferredcites →https://doi.org/10.1145/571637.571640openalex-snapshot
Practical byzantine fault tolerance and proactive recovery
inferredcites →https://doi.org/10.1145/62212.62225openalex-snapshot
Optimal algorithms for Byzantine agreement
inferredcites →https://doi.org/10.1145/800070.802215openalex-snapshot
Polynomial algorithms for multiple processor agreement
inferredcites →https://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement
inferredcites →https://doi.org/10.48550/arxiv.1002.4561openalex-snapshot
Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary
inferredcites →https://doi.org/10.48550/arxiv.1007.1049openalex-snapshot
Simple Gradecast Based Algorithms
inferredcites →https://doi.org/10.5555/1298455.1298473openalex-snapshot
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
inferredcites →https://doi.org/10.5555/296806.296824openalex-snapshot
Practical Byzantine fault tolerance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-72023-4_7openalex-snapshot
Failures and Damages in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_32openalex-snapshot
Accurate Byzantine Agreement with Feedback
inferred← citeshttps://doi.org/10.1007/s11227-014-1291-xopenalex-snapshot
The $$k$$ k -Set consensus problem with weight consideration
inferred← citeshttps://doi.org/10.1109/dsn69566.2026.00061openalex-snapshot
Robust and Automated Reconfiguration of Byzantine Wide-Area Replication
inferred← citeshttps://doi.org/10.1109/icc45855.2022.9838903openalex-snapshot
DWBFT: A Weighted Byzantine Fault Tolerant Protocol with Decentralized Trust
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00104openalex-snapshot
Byzantine Agreement with Unknown Participants and Failures
inferred← citeshttps://doi.org/10.1109/tem.2020.2981286openalex-snapshot
PREStO: A Systematic Framework for Blockchain Consensus Protocols
inferred← citeshttps://doi.org/10.1145/1993806.1993840openalex-snapshot
Accurate byzantine agreement with feedback
inferred← citeshttps://doi.org/10.1145/2993749.2993763openalex-snapshot
Distributed Computing Column 63
inferred← citeshttps://doi.org/10.1145/2993749.2993764openalex-snapshot
A Note on Fault-tolerant Consensus in Directed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1909.07433openalex-snapshot
KRNC: New Foundations for Permissionless Byzantine Consensus and Global Monetary Stability
inferred← citeshttps://doi.org/10.5815/ijwmt.2023.06.04openalex-snapshot
Mitigation of Byzantine attack using LSP algorithm in CR Networks through Blockchain Technology
inferred← citeshttps://doi.org/10.70675/b441c3a1zf42cz4cd7z8594z7121c5089d1fopenalex-snapshot
Consensus Byzantin et blockchain : Modèles unifiés et nouveaux protocoles
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.