Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
From MaRDI portal
Publication:5197682
DOI10.1145/3212734.3212770zbMath1428.68383arXiv1711.09258OpenAlexW2963324208MaRDI QIDQ5197682
Jeet Mohapatra, Hsin-Hao Su, Bernhard Haeupler
Publication date: 19 September 2019
Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.09258
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Wireless sensor networks as related to computer science (68M18)
This page was built for publication: Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
