On the public citation graph

Synchronous Consensus with Mortal Byzantines

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.
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.1002/0471478210openalex-snapshot
Distributed Computing
inferredcites →https://doi.org/10.1007/3-540-48046-3_3openalex-snapshot
Encapsulating Failure Detection: From Crash to Byzantine Failures
inferredcites →https://doi.org/10.1007/3-540-48254-7_7openalex-snapshot
Muteness Failure Detectors: Specification and Implementation
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/s00446-004-0110-7openalex-snapshot
Low complexity Byzantine-resilient consensus
inferredcites →https://doi.org/10.1016/j.jalgor.2003.11.001openalex-snapshot
Uniform consensus is harder than consensus
inferredcites →https://doi.org/10.1093/comjnl/bxh145openalex-snapshot
From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
inferredcites →https://doi.org/10.1109/12.494101openalex-snapshot
New hybrid fault models for asynchronous approximate agreement
inferredcites →https://doi.org/10.1109/csfw.1997.596799openalex-snapshot
Unreliable intrusion detection in distributed computations
inferredcites →https://doi.org/10.1109/dsn.2005.48openalex-snapshot
Fast Byzantine Consensus
inferredcites →https://doi.org/10.1109/dsn.2006.22openalex-snapshot
Consensus with Byzantine Failures and Little System Synchrony
inferredcites →https://doi.org/10.1109/icdcs.2002.1022256openalex-snapshot
Dining philosophers that tolerate malicious crashes
inferredcites →https://doi.org/10.1109/ispdc.2004.18openalex-snapshot
Designing Modular Services in the Scattered Byzantine Failure Model
inferredcites →https://doi.org/10.1109/reldis.1988.25784openalex-snapshot
Interactive consistency with multiple failure modes
inferredcites →https://doi.org/10.1109/tc.2002.1024740openalex-snapshot
Fast asynchronous uniform consensus in real-time distributed systems
inferredcites →https://doi.org/10.1109/tdsc.2006.35openalex-snapshot
Fast Byzantine Consensus
inferredcites →https://doi.org/10.1109/tse.1986.6312888openalex-snapshot
Distributed agreement in the presence of processor and communication faults
inferredcites →https://doi.org/10.1145/1073814.1073847openalex-snapshot
Fast fault-tolerant agreement algorithms
inferredcites →https://doi.org/10.1145/1095809.1095817openalex-snapshot
Fault-scalable Byzantine fault-tolerant services
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/571637.571640openalex-snapshot
Practical byzantine fault tolerance and proactive recovery
inferredcites →https://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement
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-73721-8_1openalex-snapshot
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_42openalex-snapshot
Data Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_9openalex-snapshot
Consensus When All Processes May Be Byzantine for Some Time
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_12openalex-snapshot
Enhanced Fault-Tolerance through Byzantine Failure Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_12openalex-snapshot
Adaptive Containment of Time-Bounded Byzantine Faults
inferred← citeshttps://doi.org/10.1007/s00446-011-0147-3openalex-snapshot
Consensus in the presence of mortal Byzantine faulty processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.012openalex-snapshot
Consensus when all processes may be Byzantine for some time
inferred← citeshttps://doi.org/10.1109/icnc.2011.72openalex-snapshot
Design and Communication Complexity of Self-Stabilizing Protocols Resilient to Byzantine Faults
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346568openalex-snapshot
Quick consensus through early disposal of faulty processes
inferred← citeshttps://doi.org/10.1109/icsmc.2010.5641829openalex-snapshot
CA based quick consensus in distributed system through network partitioning
inferred← citeshttps://doi.org/10.1109/srds.2014.13openalex-snapshot
HardPaxos: Replication Hardened against Hardware Errors
inferred← citeshttps://doi.org/10.5755/j01.itc.41.2.931openalex-snapshot
Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System
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.