Dr. rer. nat. Florian Kurpicz
- Office Hours:
Monday 11:00 to 11:40 pm (Lecture Period)
By Appointment (otherwise) - Room: 222
- Phone: +49 721 608-46603
- Fax: +49 721 608-43088
- kurpicz ∂does-not-exist.kit edu
- kurpicz.org
Research Interests
- Text-index construction
- Space-efficient and compressed data structures
- Parallel and distributed algorithms
- Algorithms for large inputs
Publications
Scalable Distributed String Sorting
Kurpicz, F.; Mehnert, P.; Sanders, P.; Schimek, M.
2024. T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms (ESA 2024), London, 2nd - 4th September 2024, Ed.: T. Chan, J. Fischer, I. Fischer, J. Grzegorz, H. Grzegorz, Art.-Nr.: 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2024.83
Kurpicz, F.; Mehnert, P.; Sanders, P.; Schimek, M.
2024. T. Chan, J. Fischer, J. Iacono & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms (ESA 2024), London, 2nd - 4th September 2024, Ed.: T. Chan, J. Fischer, I. Fischer, J. Grzegorz, H. Grzegorz, Art.-Nr.: 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2024.83
Bit-Parallel Wavelet Tree Construction (Abstract)
Dinklage, P.; Fischer, J.; Kurpicz, F.; Tarnowski, J.-P.
2024. HOPC’24: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, Nantes, 17th June 2024, 37 – 38, Association for Computing Machinery (ACM). doi:10.1145/3670684.3673419
Dinklage, P.; Fischer, J.; Kurpicz, F.; Tarnowski, J.-P.
2024. HOPC’24: Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, Nantes, 17th June 2024, 37 – 38, Association for Computing Machinery (ACM). doi:10.1145/3670684.3673419
Brief Announcement: Scalable Distributed String Sorting
Kurpicz, F.; Mehnert, P.; Sanders, P.; Schimek, M.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 375–377, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660256
Kurpicz, F.; Mehnert, P.; Sanders, P.; Schimek, M.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 375–377, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660256
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Uhl, T. N.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 289–291, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660260
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Uhl, T. N.
2024. SPAA ’24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, Nantes, 17th-21st June 2024, 289–291, Association for Computing Machinery (ACM). doi:10.1145/3626183.3660260
Faster Wavelet Tree Queries
Ceregini, M.; Kurpicz, F.; Venturini, R.
2024. 2024 Data Compression Conference (DCC), Snowbird, 19th-22nd March 2024, 223 – 232, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/DCC58796.2024.00030
Ceregini, M.; Kurpicz, F.; Venturini, R.
2024. 2024 Data Compression Conference (DCC), Snowbird, 19th-22nd March 2024, 223 – 232, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/DCC58796.2024.00030
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
Uhl, T. N.; Schimek, M.; Hübner, L.; Hespe, D.; Kurpicz, F.; Seemaier, D.; Stelz, C.; Sanders, P.
2024. International Conference for High Performance Computing, Networking, Storage and Analysis (SC24), 689–709, IEEE Computer Society. doi:10.1109/SC41406.2024.00050
Uhl, T. N.; Schimek, M.; Hübner, L.; Hespe, D.; Kurpicz, F.; Seemaier, D.; Stelz, C.; Sanders, P.
2024. International Conference for High Performance Computing, Networking, Storage and Analysis (SC24), 689–709, IEEE Computer Society. doi:10.1109/SC41406.2024.00050
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Stelz, C.; Uhl, T. N.
2024. arxiv. doi:10.48550/arXiv.2404.05610
Hespe, D.; Hübner, L.; Kurpicz, F.; Sanders, P.; Schimek, M.; Seemaier, D.; Stelz, C.; Uhl, T. N.
2024. arxiv. doi:10.48550/arXiv.2404.05610
Bit-Parallel (Compressed) Wavelet Tree Construction
Dinklage, P.; Fischer, J.; Kurpicz, F.; Tarnowski, J.-P.
2023. 2023 Data Compression Conference (DCC) Hrsg.: A., Bilgin; M.W., Marcellin; J., Serra-Sagrista; J.A., Storer. Data Compression Conference (DCC 2023) Snowbird, UT, USA, 21.03.2023–24.03.2023, 81 – 90, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/DCC55655.2023.00016
Dinklage, P.; Fischer, J.; Kurpicz, F.; Tarnowski, J.-P.
2023. 2023 Data Compression Conference (DCC) Hrsg.: A., Bilgin; M.W., Marcellin; J., Serra-Sagrista; J.A., Storer. Data Compression Conference (DCC 2023) Snowbird, UT, USA, 21.03.2023–24.03.2023, 81 – 90, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/DCC55655.2023.00016
Faster Block Tree Construction
Köppl, D.; Kurpicz, F.; Meyer, D.
2023. 31st Annual European Symposium on Algorithms (ESA 2023). Ed.: I.L. Gørtz, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.74
Köppl, D.; Kurpicz, F.; Meyer, D.
2023. 31st Annual European Symposium on Algorithms (ESA 2023). Ed.: I.L. Gørtz, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.74
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Bez, D.; Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 31st Annual European Symposium on Algorithms (ESA 2023), Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Ed.: I. Gørtz, 19:1–19:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.19
Bez, D.; Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 31st Annual European Symposium on Algorithms (ESA 2023), Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Ed.: I. Gørtz, 19:1–19:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2023.19
PaCHash: Packed and Compressed Hash Tables
Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 162–175, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977561.ch14
Kurpicz, F.; Lehmann, H.-P.; Sanders, P.
2023. 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 162–175, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977561.ch14
Scalable Text Index Construction
Bingmann, T.; Dinklage, P.; Fischer, J.; Kurpicz, F.; Ohlebusch, E.; Sanders, P.
2022. Algorithms for Big Data. Hrsg.: H. Bast, 252–284, Springer Nature Switzerland. doi:10.1007/978-3-031-21534-6_14
Bingmann, T.; Dinklage, P.; Fischer, J.; Kurpicz, F.; Ohlebusch, E.; Sanders, P.
2022. Algorithms for Big Data. Hrsg.: H. Bast, 252–284, Springer Nature Switzerland. doi:10.1007/978-3-031-21534-6_14
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Kurpicz, F.
2022. String Processing and Information Retrieval – 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings. Ed.: D. Arroyuelo, 257–272, Springer International Publishing. doi:10.1007/978-3-031-20643-6_19
Kurpicz, F.
2022. String Processing and Information Retrieval – 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings. Ed.: D. Arroyuelo, 257–272, Springer International Publishing. doi:10.1007/978-3-031-20643-6_19
Practical Wavelet Tree Construction
Dinklage, P.; Ellert, J.; Fischer, J.; Kurpicz, F.; Löbel, M.
2021. Journal of experimental algorithmics, 26, Article: 1.8: 1–67. doi:10.1145/3457197
Dinklage, P.; Ellert, J.; Fischer, J.; Kurpicz, F.; Löbel, M.
2021. Journal of experimental algorithmics, 26, Article: 1.8: 1–67. doi:10.1145/3457197
Practical Performance of Space Efficient Data Structures for Longest Common Extensions
Dinklage, P.; Fischer, J.; Herlez, A.; Kociumaka, T.; Kurpicz, F.
2020. 28th Annual European Symposium on Algorithms (ESA 2020), 39:1–39:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2020.39
Dinklage, P.; Fischer, J.; Herlez, A.; Kociumaka, T.; Kurpicz, F.
2020. 28th Annual European Symposium on Algorithms (ESA 2020), 39:1–39:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2020.39
Space Efficient Construction of Lyndon Arrays in Linear Time
Bille, P.; Ellert, J.; Fischer, J.; Gørtz, I. L.; Kurpicz, F.; Munro, J. I.; Rotenberg, E.
2020. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Ed.: A. Czumaj, 14:1–14:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ICALP.2020.14
Bille, P.; Ellert, J.; Fischer, J.; Gørtz, I. L.; Kurpicz, F.; Munro, J. I.; Rotenberg, E.
2020. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Ed.: A. Czumaj, 14:1–14:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ICALP.2020.14
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory
Dinklage, P.; Fischer, J.; Kurpicz, F.
2020. Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) 2020, 214–228, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976007.17
Dinklage, P.; Fischer, J.; Kurpicz, F.
2020. Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) 2020, 214–228, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976007.17
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
Ellert, J.; Kurpicz, F.
2019. String Processing and Information Retrieval. Ed.: N.R. Brisaboa, 392–406, Springer Nature Switzerland. doi:10.1007/978-3-030-32686-9_28
Ellert, J.; Kurpicz, F.
2019. String Processing and Information Retrieval. Ed.: N.R. Brisaboa, 392–406, Springer Nature Switzerland. doi:10.1007/978-3-030-32686-9_28
SACABench: Benchmarking Suffix Array Construction
Bahne, J.; Bertram, N.; Böcker, M.; Bode, J.; Fischer, J.; Foot, H.; Grieskamp, F.; Kurpicz, F.; Löbel, M.; Magiera, O.; Pink, R.; Piper, D.; Poeplau, C.
2019. String Processing and Information Retrieval. Ed.: N. Brisaboa, 407–416, Springer International Publishing. doi:10.1007/978-3-030-32686-9_29
Bahne, J.; Bertram, N.; Böcker, M.; Bode, J.; Fischer, J.; Foot, H.; Grieskamp, F.; Kurpicz, F.; Löbel, M.; Magiera, O.; Pink, R.; Piper, D.; Poeplau, C.
2019. String Processing and Information Retrieval. Ed.: N. Brisaboa, 407–416, Springer International Publishing. doi:10.1007/978-3-030-32686-9_29
Lightweight Distributed Suffix Array Construction
Fischer, J.; Kurpicz, F.
2019. 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). Ed.: S. Kobourov, 27–38, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611975499.3
Fischer, J.; Kurpicz, F.
2019. 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). Ed.: S. Kobourov, 27–38, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611975499.3
Scalable Construction of Text Indexes with Thrill
Bingmann, T.; Gog, S.; Kurpicz, F.
2018. 2018 IEEE International Conference on Big Data (Big Data 2018), Seattle, WA, December 10-13, 2018, 634–643, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2018.8622171
Bingmann, T.; Gog, S.; Kurpicz, F.
2018. 2018 IEEE International Conference on Big Data (Big Data 2018), Seattle, WA, December 10-13, 2018, 634–643, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2018.8622171
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Kriege, N.; Kurpicz, F.; Mutzel, P.
2018. European journal of combinatorics, 68, 79–95. doi:10.1016/j.ejc.2017.07.012
Kriege, N.; Kurpicz, F.; Mutzel, P.
2018. European journal of combinatorics, 68, 79–95. doi:10.1016/j.ejc.2017.07.012
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
Fischer, J.; Kurpicz, F.; Löbel, M.
2018. 2018 proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Pagh, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611975055.2
Fischer, J.; Kurpicz, F.; Löbel, M.
2018. 2018 proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: R. Pagh, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611975055.2
Dismantling DivSufSort
Fischer, J.; Kurpicz, F.
2017. Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017. Ed.: J. Holub, 62–76, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague
Fischer, J.; Kurpicz, F.
2017. Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017. Ed.: J. Holub, 62–76, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague
Engineering a distributed full-text index
Fischer, J.; Kurpicz, F.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 120–134, SIAM Publ
Fischer, J.; Kurpicz, F.; Sanders, P.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 120–134, SIAM Publ
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
Fischer, J.; Köppl, D.; Kurpicz, F.
2016. Combinatorial Pattern Matching : 27th Annual Symposium on Combinatorial Pattern Matching, June 27-29, 2016, Tel Aviv, Israel. Ed.: R. Grossi, 26:1–26:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.CPM.2016.26
Fischer, J.; Köppl, D.; Kurpicz, F.
2016. Combinatorial Pattern Matching : 27th Annual Symposium on Combinatorial Pattern Matching, June 27-29, 2016, Tel Aviv, Israel. Ed.: R. Grossi, 26:1–26:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.CPM.2016.26
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Kriege, N.; Kurpicz, F.; Mutzel, P.
2015. Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Ed.: J. Kratochvíl, 200–212, Springer International Publishing. doi:10.1007/978-3-319-19315-1_18
Kriege, N.; Kurpicz, F.; Mutzel, P.
2015. Combinatorial Algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Ed.: J. Kratochvíl, 200–212, Springer International Publishing. doi:10.1007/978-3-319-19315-1_18
| Title | Type | Semester | Location |
|---|---|---|---|
| Text-Indexierung | Vorlesung (V) | WS 24/25 | |
| Fortgeschrittene Datenstrukturen | Vorlesung (V) | SS 2024 | |
| Text-Indexierung | Vorlesung (V) | WS 23/24 | |
| Fortgeschrittene Datenstrukturen | Vorlesung (V) | SS 2023 | |
| Text-Indexierung | Vorlesung (V) | WS 22/23 | |
| Fortgeschrittene Datenstrukturen | Vorlesung (V) | SS 2022 | |
| Text-Indexierung | Vorlesung (V) | WS 21/22 | planned: Building 50.34, Room -119 |
| Titel | Forschungsthema | Betreuer |
|---|---|---|
| LCP-Array Construction in Distributed Memory | String/Distributed Algorithms |
| Title | Subject | Supervisor | Student |
|---|---|---|---|
| Perfect Hash Function Generation on the GPU | Perfect Hashing | Dominik Bez |
|
| Compressed Bit Vectors with Rank and Select Support | Compressed/Succinct Data Structures | Tobias Paweletz |
|
| Faster Block Tree Construction | Compressed/Succinct Data Structures | Daniel Meyer |
|
| Fast and Space Efficient Wavelet Tree Construction | Compact Data Structure | Marcel Hollerbach |