 M.Sc. Lorenz Hübschle-Schneider |
|
|
Raum: 220 Tel.: +49 721 608-46781 Fax: +49 721 608-43088 huebschleUjg3∂kit edu |
|
| Titel | Tagung | Autoren | Referent |
|---|---|---|---|
| Communication Efficient Algorithms for Top-k Selection Problems | IPDPS'16 |
||
| Tree Compression with Top Trees Revisited | SEA'15 |
| Titel | Autor | Quelle |
|---|---|---|
| Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online | Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher |
ACM Transactions on Mathematical Software, Volume 44 Issue 3, 2018 |
| Titel | Typ | Ort | Semester |
|---|---|---|---|
| Seminar: Proofs from THE BOOK | Seminar (S) | Geb. 50.34, Raum 131 |
SS 2018 |
| Seminar: Proofs from THE BOOK | Seminar (S) | 50.34 Raum 131, Mi 09:45 - 11:15 |
SS 2017 |
| Übungen zu Theoretische Grundlagen der Informatik | Übung (Ü) | Gerthsen 30.21 |
WS 15/16 |
| Algorithm Engineering | Vorlesung (V) | Geb. 50.34, Raum 236 |
SS 2015 |
| Titel | Quelle | Datum |
|---|---|---|
| Communication Efficient Checking of Big Data Operations | Technical Report Oktober 2017, arXiv:1710.08255 |
23.10.2017 |
| Efficient Random Sampling – Parallel, Vectorized, Cache-Efficient, and Online | Technical Report Oktober 2016, arXiv:1610.05141 |
17.10.2016 |
| Tree Compression with Top Trees Revisited | Technical Report Juni 2015, arXiv:1506.04499 |
15.06.2015 |
| Communication Efficient Algorithms for Top-k Selection Problems | Technical Report Februar/Oktober 2015, arXiv:1502.03942 |
19.10.2015 |
