scientific article; zbMATH DE number 5764832
From MaRDI portal
Publication:3579423
zbMATH Open1192.68083MaRDI QIDQ3579423FDOQ3579423
Authors: Bruce M. Kapron, David Kempe, Valerie King, Saia Jared, Vishal Sanwalani 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
History, political science (91F10) Social choice (91B14) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cited In (5)
- On the round complexity of randomized Byzantine agreement
- Improved deterministic leader election in diameter-two networks
- Must the communication graph of MPC protocols be an expander?
- The contest between simplicity and efficiency in asynchronous Byzantine agreement
- Fault-tolerant graph realizations in the congested clique
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579423)
