Brahms

DOI10.1145/1400751.1400772MaRDI QIDQ2934341zbMATH OpenOpenAlexFDO

Authors Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, Alexander Shraer

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

random samplingByzantine faultsmembershipgossip

Mathematics Subject Classification ID

Randomized algorithms (68W20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Brahms: Byzantine resilient random membership sampling
• BERNOULLI SAMPLING
• Sampling and Birkhoff regular problems
• scientific article; zbMATH DE number 788236
• Sampling on the Sierpinski Gasket
• Group representations that resist random sampling
• On the randomness complexity of efficient sampling
• scientific article; zbMATH DE number 1097580

Cited in

(4)

• Secure peer sampling
• On the uniformity of peer sampling based on view shuffling
• Brahms: Byzantine resilient random membership sampling
• Gossiping for communication-efficient broadcast

This page was built for publication: Brahms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934341)