On the public citation graph
Consensus algorithms with one-bit messages
0 signed · 30 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.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
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.1145/10590.10596openalex-snapshot
A communication-efficient canonical form for fault-tolerant distributed protocols
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/41840.41844openalex-snapshot
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
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.1998.2770openalex-snapshot
Byzantine-Resistant Total Ordering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_5openalex-snapshot
On the Microscopic View of Time and Messages
inferred← citeshttps://doi.org/10.1007/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferred← citeshttps://doi.org/10.1007/bf02280828openalex-snapshot
Fast and simple distributed consensus
inferred← citeshttps://doi.org/10.1007/bf02280838openalex-snapshot
Efficient agreement using fault diagnosis
inferred← citeshttps://doi.org/10.1007/bfb0022151openalex-snapshot
Total ordering algorithms for asynchronous Byzantine systems
inferred← citeshttps://doi.org/10.1007/bfb0022440openalex-snapshot
Optimal amortized distributed consensus
inferred← citeshttps://doi.org/10.1007/s00446-011-0151-7openalex-snapshot
Reconciling fault-tolerant distributed computing and systems-on-chip
inferred← citeshttps://doi.org/10.1007/s10766-022-00749-yopenalex-snapshot
A Fault-Model-Relevant Classification of Consensus Mechanisms for MPI and HPC
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90004-yopenalex-snapshot
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
inferred← citeshttps://doi.org/10.1016/j.ins.2003.03.004openalex-snapshot
A flexible formal framework for masking/demasking faults
inferred← citeshttps://doi.org/10.1109/edcc.2006.11openalex-snapshot
Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip
inferred← citeshttps://doi.org/10.1109/edcc.2016.17openalex-snapshot
A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems
inferred← citeshttps://doi.org/10.1109/hicss.1999.772983openalex-snapshot
The Byzantine agreement problem: optimal early stopping
inferred← citeshttps://doi.org/10.1109/icpads.2000.857709openalex-snapshot
Circumventing/identifying faults effects
inferred← citeshttps://doi.org/10.1137/s0097539794265232openalex-snapshot
Fully Polynomial Byzantine Agreement for n > 3 t Processors in t + 1 Rounds
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/1993806.1993808openalex-snapshot
Coordinated consensus in dynamic networks
inferred← citeshttps://doi.org/10.15388/informatica.2006.129openalex-snapshot
Optimal Agreement in a Scale-Free Network Environment
inferred← citeshttps://doi.org/10.30108/jcut.200809.0022openalex-snapshot
Optimal Agreement in a Generalized Scale-Free Network
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.