7 citations · 7 across the 1 of their papers we have counts for
3 papers
cs.DS2019
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…
cs.DS2019
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…
cs.DS2015★ 7 cited
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…