31 papers:
STOC-2015-AbrahamD #complexity #polynomial- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (IA, DD), pp. 605–614.
- STOC-2014-MendesTH #distributed
- Distributed computability in Byzantine asynchronous systems (HM, CT, MH), pp. 704–713.
- STOC-2013-KingS #polynomial
- Byzantine agreement in polynomial expected time: [extended abstract] (VK, JS), pp. 401–410.
- STOC-2013-MendesH #approximate #multi
- Multidimensional approximate agreement in Byzantine asynchronous systems (HM, MH), pp. 391–400.
ICALP-v2-2012-GroceKTZ- Byzantine Agreement with a Rational Adversary (AG, JK, AT, VZ), pp. 561–572.
- ICALP-v1-2011-HirtZ
- Player-Centric Byzantine Agreement (MH, VZ), pp. 281–292.
SAC-2010-CorreiaVL #process- Asynchronous Byzantine consensus with 2f+1 processes (MC, GSV, LCL), pp. 475–480.
- ICALP-v2-2009-GuerraouiR #mobile
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures (RG, ER), pp. 484–495.
SOSP-2007-HendricksGR #fault tolerance- Low-overhead byzantine fault-tolerant storage (JH, GRG, MKR), pp. 73–86.
- SOSP-2007-KotlaADCW #fault tolerance #named
- Zyzzyva: speculative byzantine fault tolerance (RK, LA, MD, AC, ELW), pp. 45–58.
- SOSP-2007-VandiverBLM #commit #fault #scheduling #transaction #using
- Tolerating byzantine faults in transaction processing systems using commit barrier scheduling (BV, HB, BL, SM), pp. 59–72.
- STOC-2006-Ben-OrPV
- Byzantine agreement in the full-information model in O(log n) rounds (MBO, EP, VV), pp. 179–186.
- SAC-2006-BessaniFL #fault tolerance #named #tuple
- BTS: a Byzantine fault-tolerant tuple space (ANB, JdSF, LCL), pp. 429–433.
OSDI-2006-CowlingMLRS #fault tolerance #hybrid #protocol #replication- HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance (JAC, DSM, BL, RR, LS), pp. 177–190.
- STOC-2005-Ben-OrH #performance #quantum
- Fast quantum byzantine agreement (MBO, AH), pp. 481–485.
- SOSP-2005-Abd-El-MalekGGRW #fault tolerance
- Fault-scalable Byzantine fault-tolerant services (MAEM, GRG, GRG, MKR, JJW), pp. 59–74.
- SOSP-2003-YinMVAD #execution #fault tolerance
- Separating agreement from execution for byzantine fault tolerant services (JY, JPM, AV, LA, MD), pp. 253–267.
- STOC-2002-LindellLR #authentication #composition #on the
- On the composition of authenticated byzantine agreement (YL, AL, TR), pp. 514–523.
AdaEurope-2002-DoudouGG #detection #encapsulation- Encapsulating Failure Detection: From Crash to Byzantine Failures (AD, BG, RG), pp. 24–50.
TACAS-2000-GnesiLLAAM #fault #specification #validation- A Formal Specification and Validation of a Critical System in Presence of Byzantine Errors (SG, DL, GL, CA, AMA, PM), pp. 535–549.
ICPR-v4-2000-GezerlisT #music #recognition- An Optical Music Recognition System for the Notation of the Orthodox Hellenic Byzantine Music (VGG, ST), pp. 4837–4840.
- OSDI-2000-CastroL #fault tolerance
- Proactive Recovery in a Byzantine-Fault-Tolerant System (MC, BL), pp. 273–288.
- OSDI-1999-CastroL #fault tolerance
- Practical Byzantine Fault Tolerance (MC, BL), pp. 173–186.
- STOC-1997-MalkhiR
- Byzantine Quorum Systems (DM, MKR), pp. 569–578.
- STOC-1993-CanettiR #performance
- Fast asynchronous Byzantine agreement with optimal resilience (RC, TR), pp. 42–51.
- STOC-1993-GarayM #polynomial
- Fully polynomial Byzantine agreement in t+1 rounds (JAG, YM), pp. 31–41.
- STOC-1989-GrahamY #on the
- On the Improbability of Reaching Byzantine Agreements (Preliminary Version) (RLG, ACCY), pp. 467–478.
- ICALP-1989-FeldmanM #algorithm #probability
- An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.
- STOC-1988-FeldmanM #algorithm
- Optimal Algorithms for Byzantine Agreement (PF, SM), pp. 148–161.
- STOC-1985-Bracha #protocol #random
- An O(lg n) Expected Rounds Randomized Byzantine Generals Protocol (GB), pp. 316–326.
PODS-1984-Garcia-MolinaPD #database #distributed #question- Is Byzantine Agreement Useful in a Distributed Database? (HGM, FMP, SBD), pp. 61–69.
