7 citations · 13 across the 2 of their papers we have counts for
4 papers
Communication-Efficient (Weighted) Reservoir Sampling from Fully Distributed Data Streams
Lorenz Hübschle-Schneider, Peter Sanders
We consider communication-efficient weighted and unweighted (uniform) random sampling from distributed data streams presented as a sequence of mini-batches of items. This is a natu…
Linear Work Generation of R-MAT Graphs
Lorenz Hübschle-Schneider, Peter Sanders
R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful…
Tree Compression with Top Trees Revisited
Lorenz Hübschle-Schneider, Rajeev Raman
We revisit tree compression with top trees (Bille et al, ICALP'13) and present several improvements to the compressor and its analysis. By significantly reducing the amount of info…
Communication Efficient Algorithms for Top-k Selection Problems
Lorenz Hübschle-Schneider, Peter Sanders, Ingo Müller
We present scalable parallel algorithms with sublinear per-processor communication volume and low latency for several fundamental problems related to finding the most relevant elem…