Communication Efficient Algorithms for Top-k Selection Problems

v1v2 (latest)

Communication Efficient Algorithms for Top-k Selection Problems

13 February 2015

Lorenz Hübschle-Schneider

ArXiv (abs)PDF HTML

Papers citing "Communication Efficient Algorithms for Top-k Selection Problems"

5 / 5 papers shown

Title
Fast networked data selection via distributed smoothed quantile estimation Xu Zhang Marcos M. Vasconcelos 49 0 0 04 Jun 2024
Communication-Efficient (Weighted) Reservoir Sampling from Fully Distributed Data Streams Lorenz Hübschle-Schneider A. Bartschat 20 5 0 24 Oct 2019
A parallel priority queue with fast updates for GPU architectures Kyle Berney J. Iacono Ben Karsin Nodari Sitchinava 16 3 0 25 Aug 2019
Parallel Weighted Random Sampling Lorenz Hübschle-Schneider Peter Sanders 112 29 0 01 Mar 2019
Communication Efficient Checking of Big Data Operations Lorenz Hübschle-Schneider Peter Sanders 105 4 0 23 Oct 2017