Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:kurpicz [2020-05-03 20:08] |
staff:kurpicz [2020-05-18 11:26] |
||
---|---|---|---|
Line 21: | Line 21: | ||
== Lehrveranstaltung == | == Lehrveranstaltung == | ||
* **Sommersemester 2020** | * **Sommersemester 2020** | ||
- | * [[https://ls1-www.cs.uni-dortmund.de/de/lehrveranstaltungen-logidac/grundbegriffe-der-theoretischen-informatik|Grundbegriffe der Theoretischen Informatik]] | + | * [[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 61: | Line 61: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
* **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//\\ Accepted to ICALP. | * **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//\\ Accepted to ICALP. | ||
- | * **[[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 2019), 214-228. | + | * **[[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_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://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. |