On the public citation graph
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
0 signed · 64 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/bf01187076openalex-snapshot
Modular construction of an efficient 1-bit Byzantine agreement protocol
inferredcites →https://doi.org/10.1007/bf02280838openalex-snapshot
Efficient agreement using fault diagnosis
inferredcites →https://doi.org/10.1007/bfb0022442openalex-snapshot
Efficient distributed consensus with n=(3 + ɛ)t processors
inferredcites →https://doi.org/10.1007/bfb0035753openalex-snapshot
Asymptotically optimal distributed consensus
inferredcites →https://doi.org/10.1007/bfb0035770openalex-snapshot
An optimal probabilistic algorithm for synchronous Byzantine agreement
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
inferredcites →https://doi.org/10.1145/72981.73002openalex-snapshot
Modular construction of nearly optimal Byzantine agreement protocols
inferredcites →https://doi.org/10.1145/79147.79161openalex-snapshot
Knowledge and common knowledge in a distributed environment
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.21236/ada154770openalex-snapshot
The Byzantine Firing Squad Problem.
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-031-30820-8_4openalex-snapshot
PyLTA: A Verification Tool for Parameterized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-58734-4_16openalex-snapshot
Early Stopping for Any Number of Corruptions
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_6openalex-snapshot
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_6openalex-snapshot
Continuous Consensus with Ambiguous Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_45openalex-snapshot
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_10openalex-snapshot
Average Long-Lived Memoryless Consensus: The Three-Value Case
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_33openalex-snapshot
The Optimal Strategy for the Average Long-Lived Consensus
inferred← citeshttps://doi.org/10.1007/bf02280838openalex-snapshot
Efficient agreement using fault diagnosis
inferred← citeshttps://doi.org/10.1007/bf02523194openalex-snapshot
The complexity of almost-optimal simultaneous coordination
inferred← citeshttps://doi.org/10.1007/s10479-008-0328-zopenalex-snapshot
Computer science and decision theory
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90011-6openalex-snapshot
Distributed consensus revisited
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.034openalex-snapshot
The Do-All problem with Byzantine processor failures
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.036openalex-snapshot
Agreement in synchronous networks with ubiquitous faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.005openalex-snapshot
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.025openalex-snapshot
Continuous consensus with ambiguous failures
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00063-1openalex-snapshot
Stability of long-lived consensus
inferred← citeshttps://doi.org/10.1109/71.667895openalex-snapshot
Byzantine agreement in the presence of mixed faults on processors and links
inferred← citeshttps://doi.org/10.1109/access.2021.3132253openalex-snapshot
A Framework for Coordinated Self-Assembly of Networked Microgrids Using Consensus Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2007.44openalex-snapshot
Round Complexity of Authenticated Broadcast with a Dishonest Majority
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00103openalex-snapshot
Exact Consensus under Global Asymmetric Byzantine Links
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00134openalex-snapshot
Robust P2P Primitives Using SGX Enclaves
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486394openalex-snapshot
Randomized View Reconciliation in Permissionless Distributed Systems
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213388openalex-snapshot
Uniform agreement despite process omission failures
inferred← citeshttps://doi.org/10.1109/prdc.2002.1185641openalex-snapshot
Consensus in synchronous systems: a concise guided tour
inferred← citeshttps://doi.org/10.1109/reldis.2004.1353024openalex-snapshot
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
inferred← citeshttps://doi.org/10.1109/tdsc.2005.13openalex-snapshot
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
inferred← citeshttps://doi.org/10.1109/tnet.2020.3004834openalex-snapshot
Randomized View Reconciliation in Permissionless Distributed Systems
inferred← citeshttps://doi.org/10.1137/1.9780898717518.ch1openalex-snapshot
1. Challenges for Discrete Mathematics and Theoretical Computer Science in the Defense against Bioterrorism
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.1142/s0129626405002131openalex-snapshot
$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS
inferred← citeshttps://doi.org/10.1145/1380564.1380571openalex-snapshot
Secure Time Synchronization in Sensor Networks
inferred← citeshttps://doi.org/10.1145/167088.167101openalex-snapshot
Fully polynomial Byzantine agreement in t + 1 rounds
inferred← citeshttps://doi.org/10.1145/2371656.2371657openalex-snapshot
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
inferred← citeshttps://doi.org/10.1145/248052.248091openalex-snapshot
An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
inferred← citeshttps://doi.org/10.1145/2746539.2746581openalex-snapshot
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity
inferred← citeshttps://doi.org/10.1145/343477.343633openalex-snapshot
Stability of long-lived consensus (extended abstract)
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/3583668.3594578openalex-snapshot
Distributed CONGEST Algorithms against Mobile Adversaries
inferred← citeshttps://doi.org/10.1145/3732772.3733536openalex-snapshot
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
inferred← citeshttps://doi.org/10.2200/s00294ed1v01y201009dct003openalex-snapshot
Fault-tolerant Agreement in Synchronous Message-passing Systems
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.24openalex-snapshot
General CONGEST Compilers against Adversarial Edges
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.