Speed-Consumption Tradeoff for Electric Vehicle Route Planning. - Moritz Baum; Julian Dibbelt; Lorenz Hübschle-Schneider; Thomas Pajor; Dorothea Wagner (ATMOS, 2014)

Tree Compression with Top Trees Revisited. - Lorenz Hübschle-Schneider; Rajeev Raman (SEA, 2015)

Communication Efficient Algorithms for Top-k Selection Problems. - Lorenz Hübschle-Schneider; Peter Sanders 001; Ingo Müller 002 (CoRR, 2015)

Communication Efficient Algorithms for Top-k Selection Problems. - Lorenz Hübschle-Schneider; Peter Sanders 001 (IPDPS, 2016)

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (CoRR, 2016)

Communication Efficient Checking of Big Data Operations. - Lorenz Hübschle-Schneider; Peter Sanders 001 (IPDPS, 2018)

Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (ACM Trans. Math. Softw., 2018)

Communication-Efficient (Weighted) Reservoir Sampling. - Lorenz Hübschle-Schneider; Peter Sanders 001 (CoRR, 2019)

Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. - Lorenz Hübschle-Schneider; Peter Sanders 001 (SPAA, 2020)

Linear work generation of R-MAT graphs. - Lorenz Hübschle-Schneider; Peter Sanders 001 (Netw. Sci., 2020)

Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking. - Lorenz Hübschle-Schneider (2020)

Weighted Random Sampling on GPUs. - Hans-Peter Lehmann; Lorenz Hübschle-Schneider; Peter Sanders 001 (CoRR, 2021)

Fast Succinct Retrieval and Approximate Membership Using Ribbon. - Peter C. Dillinger; Lorenz Hübschle-Schneider; Peter Sanders 001; Stefan Walzer (SEA, 2022)

Parallel Weighted Random Sampling. - Lorenz Hübschle-Schneider; Peter Sanders 001 (ACM Trans. Math. Softw., 2022)