On the public citation graph

SAREK: Optimistic Parallel Ordering in Byzantine Fault Tolerance

https://doi.org/10.1109/edcc.2016.36

0 signed · 50 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.1109/dsn.2004.1311928openalex-snapshot

High throughput Byzantine fault tolerance

inferredcites →https://doi.org/10.1109/dsn.2014.41openalex-snapshot

Scalable State-Machine Replication

inferredcites →https://doi.org/10.1109/hase.2010.19openalex-snapshot

EBAWA: Efficient Byzantine Agreement for Wide-Area Networks

inferredcites →https://doi.org/10.1109/icdcs.2013.53openalex-snapshot

RBFT: Redundant Byzantine Fault Tolerance

inferredcites →https://doi.org/10.1109/icdcs.2014.45openalex-snapshot

Rethinking State-Machine Replication for Parallelism

inferredcites →https://doi.org/10.1109/srds.2009.36openalex-snapshot

Spin One's Wheels? Byzantine Fault Tolerance with a Spinning Primary

inferredcites →https://doi.org/10.1109/srds.2014.25openalex-snapshot

Optimistic Parallel State-Machine Replication

inferredcites →https://doi.org/10.1109/tc.2015.2495213openalex-snapshot

Resource-Efficient Byzantine Fault Tolerance

inferredcites →https://doi.org/10.1145/1165389.945470openalex-snapshot

Separating agreement from execution for byzantine fault tolerant services

inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot

Benchmarking cloud serving systems with YCSB

inferredcites →https://doi.org/10.1145/1966445.1966455openalex-snapshot

Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency

inferredcites →https://doi.org/10.1145/2213836.2213838openalex-snapshot

Calvin

inferredcites →https://doi.org/10.1145/2517349.2517350openalex-snapshot

There is more consensus in Egalitarian parliaments

inferredcites →https://doi.org/10.1145/279227.279229openalex-snapshot

The part-time parliament

inferredcites →https://doi.org/10.1145/2814576.2814800openalex-snapshot

Consensus-Oriented Parallelization

inferredcites →https://doi.org/10.1145/502034.502037openalex-snapshot

BASE

inferredcites →https://doi.org/10.1145/62546.62549openalex-snapshot

Viewstamped replication: a general primary copy

inferredcites →https://doi.org/10.1145/844128.844130openalex-snapshot

Farsite

inferredcites →https://doi.org/10.1145/945469.945470openalex-snapshot

Separating agreement from execution for byzantine fault tolerant services

inferredcites →https://doi.org/10.1145/98163.98167openalex-snapshot

Implementing fault-tolerant services using the state machine approach: a tutorial

inferredcites →https://doi.org/10.5555/1251229.1251248openalex-snapshot

Proactive recovery in a Byzantine-fault-tolerant system

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.1002/cpe.70581openalex-snapshot

Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window

inferred← citeshttps://doi.org/10.1007/978-3-031-01877-0openalex-snapshot

Fault-Tolerant Distributed Transactions on Blockchain

inferred← citeshttps://doi.org/10.1007/978-981-15-8101-4_5openalex-snapshot

Review on Variant Consensus Algorithms Based on PBFT

inferred← citeshttps://doi.org/10.1007/978-981-15-9213-3_7openalex-snapshot

PBFT Consensus Performance Optimization Method for Fusing C4.5 Decision Tree in Blockchain

inferred← citeshttps://doi.org/10.1007/s00607-018-0652-3openalex-snapshot

Scalable Byzantine fault-tolerant state-machine replication on heterogeneous servers

inferred← citeshttps://doi.org/10.1109/access.2021.3101717openalex-snapshot

Adventures of a Light Blockchain Protocol in a Forest of Transactions: A Subset of a Story

inferred← citeshttps://doi.org/10.1109/dsa51864.2020.00066openalex-snapshot

Performance optimisation Method of PBFT Consensus for Supply Chain Integration SVM

inferred← citeshttps://doi.org/10.1109/dsn-w.2018.00056openalex-snapshot

Dynamic State Partitioning in Parallelized Byzantine Fault Tolerance

inferred← citeshttps://doi.org/10.1109/dsn.2018.00017openalex-snapshot

Byzantine Fault-Tolerant Atomic Multicast

inferred← citeshttps://doi.org/10.1109/edcc.2017.15openalex-snapshot

Scalable Byzantine Fault Tolerance on Heterogeneous Servers

inferred← citeshttps://doi.org/10.1109/edcc51268.2020.00012openalex-snapshot

Developing Complex Data Structures over Partitioned State Machine Replication

inferred← citeshttps://doi.org/10.1109/icdcs.2019.00145openalex-snapshot

DynaStar: Optimized Dynamic Partitioning for Scalable State Machine Replication

inferred← citeshttps://doi.org/10.1109/icde51399.2021.00124openalex-snapshot

RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing

inferred← citeshttps://doi.org/10.1109/icde55515.2023.00148openalex-snapshot

SChain: Scalable Concurrency over Flexible Permissioned Blockchain

inferred← citeshttps://doi.org/10.1109/prdc53464.2021.00019openalex-snapshot

Egalitarian Byzantine Fault Tolerance

inferred← citeshttps://doi.org/10.1109/srds47363.2019.00026openalex-snapshot

Deterministic Fuzzy Checkpoints

inferred← citeshttps://doi.org/10.1145/3301419.3323968openalex-snapshot

In Search of a Scalable Raft-based Replication Architecture

inferred← citeshttps://doi.org/10.1145/3380787.3393686openalex-snapshot

Low-latency geo-replicated state machines with guaranteed writes

inferred← citeshttps://doi.org/10.1145/3423211.3425689openalex-snapshot

Resilient Cloud-based Replication with Low Latency

inferred← citeshttps://doi.org/10.1145/3436728openalex-snapshot

Byzantine Fault-tolerant State-machine Replication from a Systems Perspective

inferred← citeshttps://doi.org/10.1145/3477132.3483552openalex-snapshot

Basil

inferred← citeshttps://doi.org/10.1145/3652892.3700775openalex-snapshot

Targeting Tail Latency in Replicated Systems with Proactive Rejection

inferred← citeshttps://doi.org/10.1145/3786658openalex-snapshot

Hyra: Scalable Byzantine-Resilient State Storage Engine with Hierarchical Erasure-Coding

inferred← citeshttps://doi.org/10.18420/fbsys2019-01openalex-snapshot

Efficient Checkpointing in Byzantine Fault-Tolerant Systems

inferred← citeshttps://doi.org/10.2200/s01068ed1v01y202012dtm065openalex-snapshot

Fault-Tolerant Distributed Transactions on Blockchain

inferred← citeshttps://doi.org/10.3390/app132212163openalex-snapshot

HAE: A Hybrid Cryptographic Algorithm for Blockchain Medical Scenario Applications

inferred← citeshttps://doi.org/10.3390/electronics12061460openalex-snapshot

Improvement of PBFT Algorithm Based on CART

inferred← citeshttps://doi.org/10.5753/sscad.2024.244785openalex-snapshot

Lightweight Asynchronous Repartitioning for Local State Partitioned Systems

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.