| Dismantling DivSufSort J Fischer, F Kurpicz Prague Stringology Conference, 2017 | 34 | 2017 |
| Engineering compact data structures for rank and select queries on bit vectors F Kurpicz International Symposium on String Processing and Information Retrieval, 257-272, 2022 | 20 | 2022 |
| Practical performance of space efficient data structures for longest common extensions P Dinklage, J Fischer, A Herlez, T Kociumaka, F Kurpicz 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 20 | 2020 |
| On the benefit of merging suffix array intervals for parallel pattern matching J Fischer, D Köppl, F Kurpicz 27th Annual Symposium on Combinatorial Pattern Matching, 26:1-26:11, 2016 | 18 | 2016 |
| Simple, fast and lightweight parallel wavelet tree construction J Fischer, F Kurpicz, M Löbel 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018 | 17* | 2018 |
| On maximum common subgraph problems in series–parallel graphs N Kriege, F Kurpicz, P Mutzel European Journal of Combinatorics 68, 79-95, 2018 | 15 | 2018 |
| Practical wavelet tree construction P Dinklage, J Ellert, J Fischer, F Kurpicz, M Löbel Journal of Experimental Algorithmics (JEA) 26, 1-67, 2021 | 14 | 2021 |
| Lightweight distributed suffix array construction J Fischer, F Kurpicz 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019 | 14 | 2019 |
| Space Efficient Construction of Lyndon Arrays in Linear Time P Bille, J Ellert, J Fischer, IL Gørtz, F Kurpicz, I Munro, E Rotenberg 47th International Colloquium on Automata, Languages, and Programming, 14:1 …, 2020 | 13 | 2020 |
| Parallel external memory wavelet tree and wavelet matrix construction J Ellert, F Kurpicz International Symposium on String Processing and Information Retrieval, 392-406, 2019 | 8 | 2019 |
| SACABench: Benchmarking suffix array construction J Bahne, N Bertram, M Böcker, J Bode, J Fischer, H Foot, F Grieskamp, ... String Processing and Information Retrieval: 26th International Symposium …, 2019 | 8 | 2019 |
| High Performance Construction of RecSplit Based Minimal Perfect Hash Functions D Bez, F Kurpicz, HP Lehmann, P Sanders 31st Annual European Symposium on Algorithms (ESA 2023), 19:1--19:16, 2023 | 7 | 2023 |
| Constructing the wavelet tree and wavelet matrix in distributed memory P Dinklage, J Fischer, F Kurpicz 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020 | 7* | 2020 |
| Engineering a distributed full-text index J Fischer, F Kurpicz, P Sanders 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and …, 2017 | 7 | 2017 |
| Faster Wavelet Tree Queries M Ceregini, F Kurpicz, R Venturini 2024 Data Compression Conference (DCC), 223-232, 2024 | 6* | 2024 |
| Scalable construction of text indexes with thrill T Bingmann, S Gog, F Kurpicz 2018 IEEE International Conference on Big Data (Big Data), 634-643, 2018 | 6* | 2018 |
| Bit-parallel (compressed) wavelet tree construction P Dinklage, J Fischer, F Kurpicz, JP Tarnowski 2023 Data Compression Conference (DCC), 81-90, 2023 | 4 | 2023 |
| PaCHash: Packed and compressed hash tables F Kurpicz, HP Lehmann, P Sanders 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023 | 4 | 2023 |
| KaMPIng: Flexible and (near) zero-overhead C++ bindings for MPI TN Uhl, M Schimek, L Hübner, D Hespe, F Kurpicz, C Stelz, P Sanders arXiv preprint arXiv:2404.05610, 2024 | 3 | 2024 |
| Scalable Text Index Construction T Bingmann, P Dinklage, J Fischer, F Kurpicz, E Ohlebusch, P Sanders Algorithms for Big Data: DFG Priority Program 1736, 252-284, 2023 | 2 | 2023 |
Johannes FischerTU DortmundAdresse e-mail validée de cs.tu-dortmund.de
