ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1711.09258
  4. Cited By
Optimal Gossip Algorithms for Exact and Approximate Quantile
  Computations

Optimal Gossip Algorithms for Exact and Approximate Quantile Computations

25 November 2017
Bernhard Haeupler
Jeet Mohapatra
Hsin-Hao Su
ArXivPDFHTML

Papers citing "Optimal Gossip Algorithms for Exact and Approximate Quantile Computations"

6 / 6 papers shown
Title
Fast networked data selection via distributed smoothed quantile
  estimation
Fast networked data selection via distributed smoothed quantile estimation
Xu Zhang
Marcos M. Vasconcelos
33
0
0
04 Jun 2024
Top-k data selection via distributed sample quantile inference
Top-k data selection via distributed sample quantile inference
Xu Zhang
M. Vasconcelos
38
1
0
01 Dec 2022
The Local Information Cost of Distributed Graph Spanners
The Local Information Cost of Distributed Graph Spanners
Peter Robinson
17
0
0
22 Mar 2020
Distributed Data Summarization in Well-Connected Networks
Distributed Data Summarization in Well-Connected Networks
Hsin-Hao Su
H. Vu
14
2
0
01 Aug 2019
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Kristian Hinnenthal
Christian Scheideler
Martijn Struijs
21
1
0
24 Apr 2019
Skeap & Seap: Scalable Distributed Priority Queues for Constant and
  Arbitrary Priorities
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
Michel Feldmann
Christian Scheideler
14
5
0
09 May 2018
1