Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Previous revision
Last revision Both sides next revision
staff:kurpicz [2020-05-03 20:12]
staff:kurpicz [2021-05-01 13:04]
Florian Kurpicz
Line 1: Line 1:
 ~~NOTOC~~ ~~NOTOC~~
-====== Florian Kurpicz ======+====== ​Dr. Florian Kurpicz ====== 
 + 
 +<WRAP important 30%> 
 +Diese Seite wird seit dem 01.05.2021 nicht mehr aktualisiert. 
 + 
 +Aktuelle Informationen aktuelle Informationen finden Sie auf **[[https://​www.kurpicz.org|meiner Homepage]]**. 
 +</​WRAP>​
  
 ===== Contact ===== ===== Contact =====
-{{ :staff:kurpicz.jpg?​nolink&​100|}}+{{ :staff:kurpicz2.jpg?​nolink&​280|}}
 | Room: | OH14 R213 | | Room: | OH14 R213 |
 | Phone: | +49 231 755 7725 or 7701 (secretary)| | Phone: | +49 231 755 7725 or 7701 (secretary)|
 | Fax: | +49 231 755 7740 | | 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 | | Consultation hours: | On appointment |
 +
 +**Die hier aufgelisteten Informationen sind auf [[https://​www.kurpicz.org|meiner Homepage]] ausführlich beschrieben.**
 +
  
 ===== Research Interests ===== ===== Research Interests =====
Line 20: Line 30:
 ===== Teaching (in German) ===== ===== Teaching (in German) =====
 == Lehrveranstaltung == == 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**   * **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|Ü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**   * **Sommersemester 2019**
     * [[fischer:​teaching:​pa-ss2019|Proseminar Parallele Algorithmik]]     * [[fischer:​teaching:​pa-ss2019|Proseminar Parallele Algorithmik]]
-    * [[fischer:​teaching:​ads-ss2019|Advanced Data Structures]]+    * [[fischer:​teaching:​ads-ss2019|Seminar ​Advanced Data Structures]]
   * **Wintersemester 2018/19**   * **Wintersemester 2018/19**
     * [[fischer:​teaching:​pg-saca|Projektgruppe 616: "​SACABench"​]]     * [[fischer:​teaching:​pg-saca|Projektgruppe 616: "​SACABench"​]]
Line 44: Line 57:
  
 == Betreute studentische Arbeiten == == 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) ​   * **Johannes Neumann** Implementierung und Optimierung von Y-Fast-Tries (Master) ​
   * **Sven Brümmer** Practical Parallel Max-Cut Algorithms (Master)   * **Sven Brümmer** Practical Parallel Max-Cut Algorithms (Master)
Line 60: Line 74:
 ===== Publications ===== ===== Publications =====
 === 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. +  * **[[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. 
-  * **[[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.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_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.
 
Last modified: 2021-05-01 21:03 by Florian Kurpicz
DokuWikiRSS-Feed