Haeupler, Bernhard; Mohapatra, Jeet; Su, Hsin-Hao Optimal gossip algorithms for exact and approximate quantile computations. (English) Zbl 1428.68383 Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 179-188 (2018). MSC: 68W15 Distributed algorithms 68M14 Distributed systems 68M15 Reliability, testing and fault tolerance of networks and computer systems 68M18 Wireless sensor networks as related to computer science Keywords:fault tolerance; gossip algorithms; median; quantile computation; sensor networks PDFBibTeX XMLCite \textit{B. Haeupler} et al., in: Proceedings of the 37th ACM symposium on principles of distributed computing, PODC '18, Egham, UK, July 23--27, 2018. New York, NY: Association for Computing Machinery (ACM). 179--188 (2018; Zbl 1428.68383) Full Text: DOI arXiv