No article text was recorded for this version.
quadratic communication complexity
Version 2 of 2327 papers387 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Gromit: Benchmarking the Performance and Scalability of Blockchain Systems
- Blog: One Acceptor is Enough
- Blog: Performance Analysis of the Libra Blockchain: An Experimental Study
- Blog: Consortium Blockchain for Security and Privacy-Preserving in E-government Systems
- Blog: Byzantine Fault-Tolerant Consensus Algorithms: A Survey
- Blog: Extending Asynchronous Byzantine Agreement with Crusader Agreement
- Blog: Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments
- Blog: An End-to-End Performance Comparison of Seven Permissioned Blockchain Systems
- Blog: Dissecting the Performance of Chained-BFT
- Blog: Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios
- Blog: Efficient Extensions for Asynchronous Byzantine Agreement via Weak Agreement
- Blog: Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case (Extended Version)
- Blog: Gosig: Scalable Byzantine Consensus on Adversarial Wide Area Network for Blockchains
- Blog: Untangling Blockchain: A Data Processing View of Blockchain Systems
- Blog: A Scalable Multi-Layer PBFT Consensus for Blockchain
- Blog: CloudChain: A Cloud Blockchain Using Shared Memory Consensus and RDMA
- Blog: Scalable Byzantine Reliable Broadcast
- Blog: Talaria: A Framework for Simulation of Permissioned Blockchains for Logistics and Beyond
- Blog: An Efficient Blockchain-based Hierarchical Authentication Mechanism for Energy Trading in V2G Environment
- Blog: ESIA: An Efficient and Stable Identity Authentication for Internet of Vehicles
- Blog: GDPR-Compliant Personal Data Management: A Blockchain-based Solution
- Blog: Asynchronous Approximate Agreement with Quadratic Communication
- Blog: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication
- Blog: EIFFeL: Ensuring Integrity for Federated Learning
- Blog: BLOCKBENCH: A Framework for Analyzing Private Blockchains
- Blog: Distributed Agreement with Optimal Communication Complexity
- Blog: TBFT: Understandable and Efficient Byzantine Fault Tolerance using Trusted Execution Environment
- Blog: EBFT: Simplifying BFT Consensus Through Egalitarianism
- Blog: An End-to-End Performance Comparison of Seven Permissioned Blockchain Systems
- Blog: IEEE Access Special Section Editorial: Mobile Multimedia for Healthcare
- Blog: Decentralizing Permissioned Blockchain with Delay Towers
- Blog: Networking and Data Storage Mechanism in Blockchain
- Blog: Asynchronous Approximate Agreement with Quadratic Communication
- Blog: XRP-NDN overlay: Improving the Communication Efficiency of Consensus-Validation based Blockchains with an NDN Overlay
- Blog: Accurately Tracking Relative Positions of Moving Trackers based on UWB Ranging and Inertial Sensing without Anchors
- Blog: How Much Communication Resource is Needed to Run a Wireless Blockchain Network?
- Blog: Optimal and Error-Free Multi-Valued Byzantine Consensus Through Parallel Execution
- Blog: Fast scalable deterministic consensus for crash failures
- Blog: Blockchain Transaction Processing
- Blog: Blockchain for IoT Access Control: Recent Trends and Future Research Directions
- Blog: The Case for Accelerating BFT Protocols Using In-Network Ordering
- Blog: Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary
- Blog: Crime and Punishment in Distributed Byzantine Decision Tasks
- Blog: Improvement of PBFT Algorithm Based on CART
- Blog: JUMBO: Fully Asynchronous BFT Consensus Made Truly Scalable
- Blog: Integrating On-chain and Off-chain Governance for Supply Chain Transparency and Integrity
- Blog: Rubato: Provably Post-Quantum Secure and Batched Asynchronous Randomness Beacon
- Blog: As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
- Blog: MarketBayes: A Distributed, Market-Based Bayesian Network
- Blog: APUS: fast and scalable paxos on RDMA
- Blog: Cabinet: Dynamically Weighted Consensus Made Fast
- Blog: dFLMoE: Decentralized Federated Learning via Mixture of Experts for Medical Data Analysis
- Blog: Quantum Byzantine Agreement Against Full-Information Adversary
- Blog: Resilient Average Consensus: A Detection and Compensation Approach
- Blog: Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension
- Blog: Vericom: A Verification and Communication Architecture for IoT-based Blockchain
- Blog: Efficient Signature-Free Validated Agreement
- Blog: On the Correctness of Speculative Consensus
- Blog: AED: An Anytime Evolutionary DCOP Algorithm
- Blog: Decentralized Federated Policy Gradient with Byzantine Fault-Tolerance and Provably Fast Convergence
Showing 60 of 327 papers.
History & citation
Current · Permanent link
- Eliminating Single Leader Bottlenecks in Byzantine Consensus merged into this direction (56% overlap)
- Linear Communication Byzantine Fault Tolerance merged into this direction (75% overlap)
- unauthenticated consensus latency split from this direction (56% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_quadratic_communication_complexity_e6255cee,
title = {quadratic communication complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-communication-complexity/rdr_e6255cee07b54f36b62a6bb6cd37f307},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_quadratic_communication_complexity_e6255cee_v2,
title = {quadratic communication complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quadratic-communication-complexity/rdr_e6255cee07b54f36b62a6bb6cd37f307/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}