Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:kurpicz [2019-01-14 09:44] |
staff:kurpicz [2019-04-01 09:27] |
||
---|---|---|---|
Line 20: | Line 20: | ||
===== Teaching (in German) ===== | ===== Teaching (in German) ===== | ||
== Lehrveranstaltung == | == Lehrveranstaltung == | ||
+ | * **Sommersemester 2019** | ||
+ | * [[fischer:teaching:pa-ss2019|Proseminar Parallele Algorithmik]] | ||
+ | * [[fischer:teaching:ads-ss2019|Advanced Data Structures]] | ||
+ | * **Wintersemester 2018/19** | ||
+ | * [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]] | ||
* **Sommersemester 2018** | * **Sommersemester 2018** | ||
* [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]] | * [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]] | ||
Line 37: | Line 42: | ||
== Betreute studentische Arbeiten == | == Betreute studentische Arbeiten == | ||
+ | * **[[staff:dinklage|Patrick Dinklage]]** [[fischer:abschlussarbeiten:distributed_wt|Verteilte parallele Konstruktion von Wavelet-Trees]] (Master) | ||
+ | * **[[staff:herlez|Alexander Herlez]]** [[fischer:abschlussarbeiten:lce|Implementierung und Auswertung einer Datenstruktur für LCEs]] (Bachelor) | ||
* **Tim Schonscheck** [[fischer:abschlussarbeiten:com_sparse_sa|Textkompression mithilfe eines sparse Suffix Arrays]] (Bachelor) | * **Tim Schonscheck** [[fischer:abschlussarbeiten:com_sparse_sa|Textkompression mithilfe eines sparse Suffix Arrays]] (Bachelor) | ||
* **Uwe Jentsch** [[fischer:abschlussarbeiten:suffix_lcp|Suffixsortierung mit integrierter LCP-Berechnung]] (Master) | * **Uwe Jentsch** [[fischer:abschlussarbeiten:suffix_lcp|Suffixsortierung mit integrierter LCP-Berechnung]] (Master) | ||
Line 48: | Line 55: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
* **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //Johannes Fischer, Florian Kurpicz//\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38. | * **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //Johannes Fischer, Florian Kurpicz//\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38. | ||
- | * **Scalable Construction of Text Indexes with Thrill** ([[https://arxiv.org/abs/1610.03007|preliminary arXiv preprint]])\\ //Timo Bingmann, Simon Gog, Florian Kurpicz//\\ Accepted at IEEE Big Data '18 | + | * **[[https://doi.org/10.1109/BigData.2018.8622171|Scalable Construction of Text Indexes with Thrill]]** ([[https://arxiv.org/abs/1610.03007|preliminary arXiv preprint]])\\ //Timo Bingmann, Simon Gog, Florian Kurpicz//\\ Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634--643. |
* **[[https://doi.org/10.1137/1.9781611975055.2|Simple, Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://arxiv.org/abs/1702.07578|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Marvin Löbel// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20. | * **[[https://doi.org/10.1137/1.9781611975055.2|Simple, Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://arxiv.org/abs/1702.07578|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Marvin Löbel// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20. | ||
* **[[http://www.stringology.org/event/2017/p07.html|Dismantling DivSufSort]]** ([[https://arxiv.org/abs/1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76. | * **[[http://www.stringology.org/event/2017/p07.html|Dismantling DivSufSort]]** ([[https://arxiv.org/abs/1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76. |