Florian Kurpicz

Orcid: 0000-0002-2379-9455

Affiliations:
  • Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
  • Technical University of Dortmund, Department of Computer Science, Germany (former, PhD 2020)


According to our database1, Florian Kurpicz authored at least 29 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI.
CoRR, 2024

Brief Announcement: Scalable Distributed String Sorting.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Bit-Parallel Wavelet Tree Construction (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Scalable Distributed String Sorting.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Faster Wavelet Tree Queries.
Proceedings of the Data Compression Conference, 2024

2023
Faster Wavelet Trees with Quad Vectors.
CoRR, 2023

Faster Block Tree Construction.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Bit-Parallel (Compressed) Wavelet Tree Construction.
Proceedings of the Data Compression Conference, 2023

PaCHash: Packed and Compressed Hash Tables.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors.
Proceedings of the String Processing and Information Retrieval, 2022

Scalable Text Index Construction.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021
Practical Wavelet Tree Construction.
ACM J. Exp. Algorithmics, 2021

2020
Parallel text index construction.
PhD thesis, 2020

Space Efficient Construction of Lyndon Arrays in Linear Time.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction.
Proceedings of the String Processing and Information Retrieval, 2019

SACABench: Benchmarking Suffix Array Construction.
Proceedings of the String Processing and Information Retrieval, 2019

Lightweight Distributed Suffix Array Construction.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
On maximum common subgraph problems in series-parallel graphs.
Eur. J. Comb., 2018

Scalable Construction of Text Indexes with Thrill.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

Simple, Fast and Lightweight Parallel Wavelet Tree Construction.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Fast and Simple Parallel Wavelet Tree and Matrix Construction.
CoRR, 2017

Dismantling DivSufSort.
Proceedings of the Prague Stringology Conference 2017, 2017

Engineering a Distributed Full-Text Index.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Scalable Construction of Text Indexes.
CoRR, 2016

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016


  Loading...