This is an old revision of the document!
Florian Kurpicz
Contact
Room: | OH14 R213 |
Phone: | +49 231 755 7725 or 7701 (secretary) |
Fax: | +49 231 755 7740 |
E-Mail: | florian.kurpicz@tu-dortmund.de PGP-Key |
Consultation hours: | On appointment |
Research Interests
Departmental Duties
- Course Guidance for Computer Science
- Co-Organizer of the GCPC 2016 in Dortmund
Teaching (in German)
Lehrveranstaltung
- Sommersemester 2019
- Wintersemester 2018/19
- Sommersemester 2018
- Sommersemester 2017
- Wintersemester 2015/16
- Sommersemester 2015
- Wintersemester 2014/15
- Sommersemester 2014
Betreute studentische Arbeiten
- Christopher Osthues LCEs mit Recompression (Master)
- Tim Schonscheck Textkompression mithilfe eines sparse Suffix Arrays (Bachelor)
- Uwe Jentsch Suffixsortierung mit integrierter LCP-Berechnung (Master)
- Lucas Weiße Aufbau eines Clusters mithilfe von Raspberry Pis (Bachelor)
- Jan Laumeyer Effiziente Beantwortung von PSV-Anfragen (Bachelor)
- Jan Henrik Wienbrack Verteilte Textkompression mit Hilfe des LCP-Arrays (Bachelor)
- Benedikt Oesing: Effiziente Erstellung von Waveletmatrizen (Bachelor)
- Patrick Nowak: Praktische Evaluation einer LZ77-Approximation (Bachelor)
- Maximilian Schwarzbach: Visuelle Programmierung - Der Versuch einer Begriffsdefinition (Bachelor)
Publications
Refereed Conference Proceedings
- Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
Jonas Ellert, Florian Kurpicz
SPIRE 2019, to appear. - 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
SPIRE 2019, to appear. - 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 (preliminary arXiv preprint)
Timo Bingmann, Simon Gog, Florian Kurpicz
Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634–643. - Simple, Fast and Lightweight Parallel Wavelet Tree Construction (arXiv version)
Johannes Fischer, Florian Kurpicz, Marvin Löbel
Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9–20. - Dismantling DivSufSort (arXiv version)
Johannes Fischer, Florian Kurpicz
Proceedings of the Prague Stringology Conference (PSC 2017), 62–76. - Engineering a Distributed Full-Text Index (arXiv version)
Johannes Fischer, Florian Kurpicz, Peter Sanders
Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120–134 - On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching (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 - On Maximum Common Subgraph Problems in Series-Parallel Graphs (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
- On Maximum Common Subgraph Problems in Series-Parallel Graphs (arXiv version)
Nils Kriege, Florian Kurpicz, Petra Mutzel
European Journal of Combinatorics (Eur. J. Combin.), 68:79–95, 2018.
Further Information
Please visit our group site for further information.