On the price of equivocation in byzantine agreement

DOI10.1145/2332432.2332491zbMath1301.68068MaRDI QIDQ2933806

Siddhartha Sen, Thomas Moscibroda, Alexander Jaffe

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2332432.2332491

zbMATH Keywords

expander graphs; Byzantine agreement; hypergraph coloring; partial broadcast

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

68W15: Distributed algorithms

Related Items

Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs