Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision Next revision Both sides next revision | ||
|
staff:kurpicz [2019-10-08 19:57] |
staff:kurpicz [2020-06-29 15:12] Florian Kurpicz [Publications] |
||
|---|---|---|---|
| Line 20: | Line 20: | ||
| ===== Teaching (in German) ===== | ===== Teaching (in German) ===== | ||
| == Lehrveranstaltung == | == Lehrveranstaltung == | ||
| + | * **Sommersemester 2020** | ||
| + | * [[https://ls1-www.cs.uni-dortmund.de/de/lehrveranstaltungen-logidac/grundbegriffe-der-theoretischen-informatik|Grundbegriffe der theoretischen Informatik]] | ||
| * **Sommersemester 2019** | * **Sommersemester 2019** | ||
| * [[fischer:teaching:pa-ss2019|Proseminar Parallele Algorithmik]] | * [[fischer:teaching:pa-ss2019|Proseminar Parallele Algorithmik]] | ||
| Line 42: | Line 44: | ||
| == Betreute studentische Arbeiten == | == Betreute studentische Arbeiten == | ||
| + | * **Johannes Neumann** Implementierung und Optimierung von Y-Fast-Tries (Master) | ||
| + | * **Sven Brümmer** Practical Parallel Max-Cut Algorithms (Master) | ||
| * **[[staff:ellert|Jonas Ellert]]** [[fischer:abschlussarbeiten:nss|Efficient Computation of Nearest Smaller Suffixes]] (Master) | * **[[staff:ellert|Jonas Ellert]]** [[fischer:abschlussarbeiten:nss|Efficient Computation of Nearest Smaller Suffixes]] (Master) | ||
| * **Christopher Osthues** [[fischer:abschlussarbeiten:lce_recomp|LCEs mit Recompression]] (Master) | * **Christopher Osthues** [[fischer:abschlussarbeiten:lce_recomp|LCEs mit Recompression]] (Master) | ||
| Line 56: | Line 60: | ||
| ===== Publications ===== | ===== Publications ===== | ||
| === Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
| - | * **Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory**\\ //Patrick Dinklage, Johannes Fischer, Florian Kurpicz//\\ ALENEX 2020, to appear. | + | * **Practical Performance of Space Efficient Data Structures for Longest Common Extensions**\\ //Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz//\\ Accepted at ESA. |
| - | * **Parallel External Memory Wavelet Tree and Wavelet Matrix Construction**\\ //Jonas Ellert, Florian Kurpicz//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 407--416. | + | * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]** [[http://arxiv.org/abs/1911.03542|(arXiv version)]]\\ //Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg//\\ Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 14:1--14:18. |
| - | * **SACABench: Benchmarking Suffix Array Construction**\\ //Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, and Christopher Poeplau//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 392--406. | + | * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //Patrick Dinklage, Johannes Fischer, Florian Kurpicz//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2020), 214-228. |
| + | * **[[https://doi.org/10.1007/978-3-030-32686-9_28|Parallel External Memory Wavelet Tree and Wavelet Matrix Construction]]**\\ //Jonas Ellert, Florian Kurpicz//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 407--416. | ||
| + | * **[[https://doi.org/10.1007/978-3-030-32686-9_29|SACABench: Benchmarking Suffix Array Construction]]**\\ //Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, and Christopher Poeplau//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 392--406. | ||
| * **[[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. | ||
| * **[[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.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. | ||