Dr. rer. nat. Lorenz Hübschle-Schneider
- Herr Dr. Hübschle-Schneider hat unser Institut inzwischen verlassen.
Forschungsschwerpunkte
- Kommunikationseffiziente Algorithmen
- Algorithmen für verteilte Datenströme (Streams)
- Probabilistische Algorithmen
Software
Die folgenden Softwarepakete sind im Zusammenhang mit meiner Forschung entstanden:
- Parallel Weighted Random Sampling – Algorithmen für paralleles und sequentielles Sampling mit Gewichten
- Weighted Reservoir Sampling – Verteiltes gewichtetes Sampling aus Datenströmen (Reservoir-Sampling)
- Efficient Random Sampling – Algorithmen für schnelles uniformes Sampling
- Linear Work Generation of R-MAT Graphs – Schnelle parallele Generierung von R-MAT-Graphen mittels Weighted Sampling
- Super Scalar Sample Sort – eine Re-Implementierung von SSSS in modernem C++
- Tree Compression with Top Trees
Veröffentlichungen
Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking. Dissertation
Hübschle-Schneider, L.
2020, Dezember 17. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000127719
Hübschle-Schneider, L.
2020, Dezember 17. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000127719
Linear work generation of R-MAT graphs
Hübschle-Schneider, L.; Sanders, P.
2020. Network science, 8 (4), 543–550. doi:10.1017/nws.2020.21
Hübschle-Schneider, L.; Sanders, P.
2020. Network science, 8 (4), 543–550. doi:10.1017/nws.2020.21
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams
Hübschle-Schneider, L.; Sanders, P.
2020. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 543–545, Association for Computing Machinery (ACM). doi:10.1145/3350755.3400287
Hübschle-Schneider, L.; Sanders, P.
2020. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 543–545, Association for Computing Machinery (ACM). doi:10.1145/3350755.3400287
Parallel Weighted Random Sampling
Hübschle-Schneider, L.; Sanders, P.
2019. 27th European Symposium on Algorithms, Munich/Garching, Germany, 9th - 11th September 2019. Hrsg.: M.A. Bender, Aritcle no: 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.ESA.2019.59
Hübschle-Schneider, L.; Sanders, P.
2019. 27th European Symposium on Algorithms, Munich/Garching, Germany, 9th - 11th September 2019. Hrsg.: M.A. Bender, Aritcle no: 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.ESA.2019.59
Communication Efficient Checking of Big Data Operations
Hübschle-Schneider, L.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 650–659, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00074
Hübschle-Schneider, L.; Sanders, P.
2018. 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 650–659, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00074
Efficient Parallel Random Sampling : Vectorized, Cache-Efficient, and Online
Sanders, P.; Lamm, S.; Hübschle-Schneider, L.; Schrade, E.; Dachsbacher, C.
2018. ACM transactions on mathematical software, 44 (3), 29:1–29:14. doi:10.1145/3157734
Sanders, P.; Lamm, S.; Hübschle-Schneider, L.; Schrade, E.; Dachsbacher, C.
2018. ACM transactions on mathematical software, 44 (3), 29:1–29:14. doi:10.1145/3157734
Communication Efficient Algorithms for Top-k Selection Problems
Hübschle-Schneider, L.; Sanders, P.
2016. 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Chicago, IL, USA, 23–27 May 2016, 659–668, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2016.45
Hübschle-Schneider, L.; Sanders, P.
2016. 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Chicago, IL, USA, 23–27 May 2016, 659–668, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2016.45
Tree Compression with Top Trees Revisited
Hübschle-Schneider, L.; Raman, R.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 15–27, Springer International Publishing. doi:10.1007/978-3-319-20086-6_2
Hübschle-Schneider, L.; Raman, R.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 15–27, Springer International Publishing. doi:10.1007/978-3-319-20086-6_2
Speed-Consumption Tradeoff for Electric Vehicle Route Planning
Baum, M.; Dibbelt, J.; Hübschle-Schneider, L.; Pajor, T.; Wagner, D.
2014. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’14), Wroclaw, Poland, September 11, 2014. Ed.: S. Funke, 138–151, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/OASIcs.ATMOS.2014.138
Baum, M.; Dibbelt, J.; Hübschle-Schneider, L.; Pajor, T.; Wagner, D.
2014. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS’14), Wroclaw, Poland, September 11, 2014. Ed.: S. Funke, 138–151, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/OASIcs.ATMOS.2014.138
| Titel | Autoren | Quelle | Datum |
|---|---|---|---|
| Weighted Random Sampling on GPUs | Hans-Peter Lehmann, Lorenz Hübschle-Schneider und Peter Sanders |
Juni 2021 | |
| Communication-Efficient (Weighted) Reservoir Sampling | Lorenz Hübschle-Schneider und Peter Sanders |
Oktober 2019 | |
| Linear Work Generation of R-MAT Graphs | Lorenz Hübschle-Schneider und Peter Sanders |
Mai 2019 | |
| Parallel Weighted Random Sampling | Lorenz Hübschle-Schneider und Peter Sanders |
März 2019 | |
| Communication Efficient Checking of Big Data Operations | Lorenz Hübschle-Schneider und Peter Sanders |
Oktober 2017 | |
| Efficient Random Sampling – Parallel, Vectorized, Cache-Efficient, and Online | Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade und Carsten Dachsbacher |
Oktober 2016 | |
| Tree Compression with Top Trees Revisited | Lorenz Hübschle-Schneider und Rajeev Raman |
Juni 2015 | |
| Communication Efficient Algorithms for Top-k Selection Problems | Lorenz Hübschle-Schneider, Peter Sanders und Ingo Müller |
Februar 2015 |
| Titel | Typ | Semester |
|---|---|---|
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2021 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2020 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2019 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2018 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2017 |
| Übungen zu Theoretische Grundlagen der Informatik | Übung (Ü) | WS 15/16 |
| Algorithm Engineering | Vorlesung (V) | SS 2015 |