scientific article; zbMATH DE number 5764832

MaRDI QIDQ3579423zbMATH OpenFDO

Authors Bruce M. Kapron, David Kempe, Valerie King, Saia Jared, Vishal Sanwalani

Publication date 6 August 2010

Mathematics Subject Classification ID

History, political science (91F10) Social choice (91B14) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Cited in

(5)

• Fault-tolerant graph realizations in the congested clique
• On the round complexity of randomized Byzantine agreement
• Improved deterministic leader election in diameter-two networks
• The contest between simplicity and efficiency in asynchronous Byzantine agreement
• Must the communication graph of MPC protocols be an expander?

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)