Publications

Here, you can find an up-to-date list of my publications. Alternatively, you can find lists at dblp, Google Scholar, and ORCID. You can also find my dissertation, my Master’s thesis, and a (possibly empty) list of not yet peer-reviewed technical reports at the bottom of this page. All open access publications are marked accordingly ( ). For non-open-access publications, preprints are provided here. Authors are sorted lexicographically, as it is standard in the algorithms community.

Book Chapters

• Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders: Scalable Text Index Construction. In: Algorithms for Big Data (SPP 2022), 252–284.
  
  DOI pdf

Journal Articles

• Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel: Practical Wavelet Tree Construction. In: ACM Journal of Experimental Algorithmics (J. Exp. Algorithmics 2021), 1.8:1–1.8:67.
  
  DOI pdf code
• Nils M. Kriege, Florian Kurpicz, Petra Mutzel: On Maximum Common Subgraph Problems in Series-Parallel Graphs. In: European Journal of Combinatorics (Eur. J. Comb. 2018), 79–95. Invited to special issue of Eur. J. Comb. for IWOCA 2014.
  
  DOI arXiv pdf

Conference Articles

• Matteo Ceregini, Florian Kurpicz, Rossano Venturini: Faster Wavelet Tree Queries. In: Accepted at Data Compression Conference (DCC 2024).
  
  arXiv pdf code
• Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders: High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. In: 31st European Symposium on Algorithms (ESA 2023), 19:1--19:16.
  
  DOI arXiv pdf code
• Dominik Köppl, Florian Kurpicz, Daniel Meyer: Faster Block Tree Construction. In: 31st European Symposium on Algorithms (ESA 2023), 74:1--74:20.
  
  DOI pdf slides code
• Patrick Dinklage, Florian Kurpicz, Johannes Fischer, Jan-Philipp Tarnowski: Bit-Parallel (Compressed) Wavelet Tree Construction. In: Proceedings of the Data Compression Conference (DCC 2023), 81--90.
  
  DOI pdf code
• Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders: PaCHash: Packed and Compressed Hash Tables. In: Proceedings of the Twenty-Fifth Symposium on Algorithm Engineering and Experiments (ALENEX 2023), 162–175.
  
  DOI arXiv slides pdf code
• Florian Kurpicz: Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. In: Twenty-Ninth International Symposium on String Processing and Information Retrieval (SPIRE 2022), 257–272.
  
  DOI arXiv slides pdf code
• Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg: Space Efficient Construction of Lyndon Arrays in Linear Time. In: Fourty-Seventh International Colloquium on Automata, Languages, and Programming (ICALP 2020), 14:1–14:18.
  
  DOI arXiv pdf code
• Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz: Practical Performance of Space Efficient Data Structures for Longest Common Extensions. In: Twenty-Eighth Annual European Symposium on Algorithms (ESA 2020), 39:1–39:20.
  
  DOI arXiv slides pdf code
• Patrick Dinklage, Johannes Fischer, Florian Kurpicz: Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. In: Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX 2020), 214–228.
  
  DOI pdf code
• Jonas Ellert, Florian Kurpicz: Parallel External Memory Wavelet Tree and Wavelet Matrix Construction. In: Twenty-Sixth International Symposium on String Processing and Information Retrieval (SPIRE 2019), 392–406.
  
  DOI pdf code
• Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Lbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau: SACABench: Benchmarking Suffix Array Construction. In: Twenty-Sixth International Symposium on String Processing and Information Retrieval (SPIRE 2019), 407–416.
  
  DOI slides pdf code
• Johannes Fischer, Florian Kurpicz: Lightweight Distributed Suffix Array Construction. In: Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27–38.
  
  DOI slides pdf code
• Timo Bingmann, Simon Gog, Florian Kurpicz: Scalable Construction of Text Indexes with Thrill. In: IEEE International Conference on Big Data (IEEE BigData 2018), 634–643.
  
  DOI arXiv pdf code
• Johannes Fischer, Florian Kurpicz, Marvin Löbel: Simple, Fast and Lightweight Parallel Wavelet Tree Construction. In: Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9–20.
  
  DOI slides pdf code
• Johannes Fischer, Florian Kurpicz: Dismantling DivSufSort. In: Proceedings of the Prague Stringology Conference (PSC 2017), 62–76.
  
  conference website arXiv slides pdf code
• Johannes Fischer, Florian Kurpicz, Peter Sanders: Engineering a Distributed Full-Text Index. In: Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120–134.
  
  DOI arXiv slides pdf code
• Johannes Fischer, Dominik Köppl, Florian Kurpicz: On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. In: Proceedings of the Twenty-Seventh Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 26:1–26:11.
  
  DOI arXiv slides pdf
• Nils M. Kriege, Florian Kurpicz, Petra Mutzel: On Maximum Common Subgraph Problems in Series-Parallel Graphs. In: Proceedings of the Twenty-Fifth International Workshop on Combinatorial Algorithms (IWOCA 2014), 200–212.
  
  DOI arXiv slides pdf

Technical Reports

• Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Christoph Stelz, Tim Niklas Uhl: KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI. In: (2024).
  
  arXiv pdf code

Theses

• Florian Kurpicz: Parallel Text Index Construction. In: Ph.D. thesis (2020).
  (supervised by Johannes Fischer)
  DOI pdf
• Florian Kurpicz: Efficient Algorithms for the Maximum Common Subgraph Problem in Partial 2-Trees. In: Master's thesis (2014).
  (supervised by Nils Kriege and Petra Mutzel)
  pdf