Co-occurring keywords · papers mentioning both
Papers
Ambulance: Saving BFT through Racing
OSDI 2026
In Link We Trust: BFT at the Speed of CFT using Switches
NSDI 2026
Lemonshark: Asynchronous DAG-BFT With Early Finality
NSDI 2026
Rethinking the Reliability of Multi-agent System: A Perspective from Byzantine Fault Tolerance
AAAI 2026
BFTBrain: Adaptive BFT Consensus with Reinforcement Learning
NSDI 2025
Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity
JMLR 2025
Picsou: Enabling Replicated State Machines to Communicate Efficiently
OSDI 2025
Shoal++: High Throughput DAG BFT Can Be Fast and Robust!
NSDI 2025
Vegeta: Enabling Parallel Smart Contract Execution in Leaderless Blockchains
NSDI 2025
Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
NSDI 2024
Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences
NeurIPS 2024
Chop Chop: Byzantine Atomic Broadcast to the Network Limit
OSDI 2024
Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
AISTATS 2024
The Bedrock of Byzantine Fault Tolerance: A Unified Platform for BFT Protocols Analysis, Implementation, and Experimentation
NSDI 2024
Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML
NeurIPS 2024
Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity
AISTATS 2023
DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks
NSDI 2022
IA-CCF: Individual Accountability for Permissioned Ledgers
NSDI 2022
BASGD: Buffered Asynchronous SGD for Byzantine Learning
ICML 2021
Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)
NeurIPS 2021
Variance Reduced Median-of-Means Estimator for Byzantine-Robust Distributed Inference
JMLR 2021
Byzantine Ordered Consensus without Byzantine Oligarchy
OSDI 2020
Zeno++: Robust Fully Asynchronous SGD
ICML 2020
DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation
NeurIPS 2019
Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation
UAI 2019