default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenz Hübschle-Schneider
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Lorenz Hübschle-Schneider
, Peter Sanders:
Parallel Weighted Random Sampling. ACM Trans. Math. Softw. 48(3): 29:1-29:40 (2022)- [c7]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA 2022: 4:1-4:20 - 2021
- [i9]Hans-Peter Lehmann, Lorenz Hübschle-Schneider, Peter Sanders:
Weighted Random Sampling on GPUs. CoRR abs/2106.12270 (2021) - [i8]Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders, Stefan Walzer:
Fast Succinct Retrieval and Approximate Membership using Ribbon. CoRR abs/2109.01892 (2021) - 2020
- [b1]Lorenz Hübschle-Schneider:
Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking. Karlsruhe Institute of Technology, Germany, 2020 - [j2]Lorenz Hübschle-Schneider, Peter Sanders:
Linear work generation of R-MAT graphs. Netw. Sci. 8(4): 543-550 (2020) - [c6]Lorenz Hübschle-Schneider, Peter Sanders:
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. SPAA 2020: 543-545
2010 – 2019
- 2019
- [c5]Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. ESA 2019: 59:1-59:24 - [i7]Lorenz Hübschle-Schneider, Peter Sanders:
Parallel Weighted Random Sampling. CoRR abs/1903.00227 (2019) - [i6]Lorenz Hübschle-Schneider, Peter Sanders:
Linear Work Generation of R-MAT Graphs. CoRR abs/1905.03525 (2019) - [i5]Lorenz Hübschle-Schneider, Peter Sanders:
Communication-Efficient (Weighted) Reservoir Sampling. CoRR abs/1910.11069 (2019) - 2018
- [j1]Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher:
Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. ACM Trans. Math. Softw. 44(3): 29:1-29:14 (2018) - [c4]Lorenz Hübschle-Schneider, Peter Sanders:
Communication Efficient Checking of Big Data Operations. IPDPS 2018: 650-659 - 2017
- [i4]Lorenz Hübschle-Schneider, Peter Sanders:
Communication Efficient Checking of Big Data Operations. CoRR abs/1710.08255 (2017) - 2016
- [c3]Lorenz Hübschle-Schneider, Peter Sanders:
Communication Efficient Algorithms for Top-k Selection Problems. IPDPS 2016: 659-668 - [i3]Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher:
Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. CoRR abs/1610.05141 (2016) - 2015
- [c2]Lorenz Hübschle-Schneider, Rajeev Raman:
Tree Compression with Top Trees Revisited. SEA 2015: 15-27 - [i2]Lorenz Hübschle-Schneider, Peter Sanders, Ingo Müller:
Communication Efficient Algorithms for Top-k Selection Problems. CoRR abs/1502.03942 (2015) - [i1]Lorenz Hübschle-Schneider, Rajeev Raman:
Tree Compression with Top Trees Revisited. CoRR abs/1506.04499 (2015) - 2014
- [c1]Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, Dorothea Wagner:
Speed-Consumption Tradeoff for Electric Vehicle Route Planning. ATMOS 2014: 138-151
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
