Differences

This shows you the differences between two versions of the page.

--- staff:kurpicz [2018-10-17 18:13]
+++ staff:kurpicz [2021-05-01 21:03] (current)
Florian Kurpicz
@@ Line 1: / Line 1: @@
 ~~NOTOC~~
-====== Florian Kurpicz ======
+====== Dr. Florian Kurpicz ======
+<WRAP important 30%>
+Diese Seite wird seit dem 01.05.2021 nicht mehr aktualisiert.
+Aktuelle Informationen finden Sie auf **[[https://www.kurpicz.org|meiner Homepage]]**.
+</WRAP>
 ===== Contact =====
-{{ :staff:kurpicz.jpg?nolink&100|}}
+{{ :staff:kurpicz2.jpg?nolink&280|}}
 | Room: | OH14 R213 |
 | Phone: | +49 231 755 7725 or 7701 (secretary)|
 | Fax: | +49 231 755 7740 |
-| E-Mail: | <florian.kurpicz@tu-dortmund.de> {{:staff:kurpicz:florian.kurpicz_tu-dortmund.de_pub.txt|PGP-Key}}|
+| E-Mail: | <florian.kurpicz@tu-dortmund.de> {{:staff:kurpicz:florian.kurpicz_tu-dortmund.de_pub.txt|PGP-Key (lokal)}} [[http://keys.gnupg.net/pks/lookup?op=vindex&fingerprint=on&search=0x01C0B72B9D2DBE25|GnuPG-Keyserver]]|
+| Homepage: | [[https://www.kurpicz.org|www.kurpicz.org]]|
 | Consultation hours: | On appointment |
+**Die hier aufgelisteten Informationen sind auf [[https://www.kurpicz.org|meiner Homepage]] ausführlich beschrieben.**
 ===== Research Interests =====
@@ Line 20: / Line 30: @@
 ===== Teaching (in German) =====
 == Lehrveranstaltung ==
+  * **Wintersemester 2020/21**
+    * [[fischer:teaching:pa-ws2020|Proseminar Parallele Algorithmik]] (als Veranstalter)
+    * Übung zur Implementierung von Algorithmen und Datenstrukturen für //Text-Indexierung//
+  * **Sommersemester 2020**
+    * [[https://ls1-www.cs.uni-dortmund.de/de/lehrveranstaltungen-logidac/grundbegriffe-der-theoretischen-informatik|Übung zu Grundbegriffe der theoretischen Informatik]] (Meine Videos zu dieser Veranstaltung: [[https://www.kurpicz.org/assets/videos/GTI-blatt04-A1.mp4|1]], [[https://www.kurpicz.org/assets/videos/GTI-blatt04-A2.mp4|2]], [[https://www.kurpicz.org/assets/videos/GTI-blatt04-A3.mp4|3]], [[https://www.kurpicz.org/assets/videos/GTI-blatt08-A1.mp4|4]], [[https://www.kurpicz.org/assets/videos/GTI-blatt08-A2.mp4|5]] und [[https://www.kurpicz.org/assets/videos/GTI-blatt08-A3.mp4|6]])
+  * **Sommersemester 2019**
+    * [[fischer:teaching:pa-ss2019|Proseminar Parallele Algorithmik]]
+    * [[fischer:teaching:ads-ss2019|Seminar Advanced Data Structures]]
+  * **Wintersemester 2018/19**
+    * [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]]
   * **Sommersemester 2018**
     * [[fischer:teaching:pg-saca|Projektgruppe 616: "SACABench"]]
@@ Line 37: / Line 57: @@
 == Betreute studentische Arbeiten ==
+  * **Mathieu Herkersdorf**  Parallele Konstruktion von Rank- und Select-Datenstrukturen im Shared Memory (Bachelor)
+  * **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)
+  * **Christopher Osthues** [[fischer:abschlussarbeiten:lce_recomp|LCEs mit Recompression]] (Master)
+  * **[[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)
   * **Uwe Jentsch** [[fischer:abschlussarbeiten:suffix_lcp|Suffixsortierung mit integrierter LCP-Berechnung]] (Master)
@@ Line 47: / Line 74: @@
 ===== Publications =====
 === Refereed Conference Proceedings ===
-  * **Lightweight Distributed Suffix Array Construction**\\ //Johannes Fischer, Florian Kurpicz//\\ Accepted at ALENEX'19
+  * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ //Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz//\\ Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020), 39:1--39:20.
-  * **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.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.
+  * **[[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 Bö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://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.
   * **[[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://dx.doi.org/10.1137/1.9781611974768.10|Engineering a Distributed Full-Text Index]]** ([[http://arxiv.org/abs/1610.03332|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Peter Sanders// \\ Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120--134
+  * **[[http://dx.doi.org/10.1137/1.9781611974768.10|Engineering a Distributed Full-Text Index]]** ([[http://arxiv.org/abs/1610.03332|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Peter Sanders// \\ Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120--134.
-  * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //Johannes Fischer, Dominik Köppl, Florian Kurpicz// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11
+  * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //Johannes Fischer, Dominik Köppl, Florian Kurpicz// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11.
-  * **[[https://dx.doi.org/10.1007/978-3-319-19315-1_18|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://arxiv.org/abs/1708.02772|extended arXiv version]]) \\ //Nils Kriege, Florian Kurpicz, Petra Mutzel// \\ Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), LNCS 8986, Springer, 200--212
+  * **[[https://dx.doi.org/10.1007/978-3-319-19315-1_18|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://arxiv.org/abs/1708.02772|extended arXiv version]]) \\ //Nils Kriege, Florian Kurpicz, Petra Mutzel// \\ Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), LNCS 8986, Springer, 200--212.
 === Journal Articles ===

Chair 11

Teaching

Research Groups

Differences