Skip to main content
Link
Search
Menu
Expand
Document
(external link)
Florian Kurpicz
About Me
Contact
Publications
Bit-Parallel (Compressed) Wavelet Tree Construction
Brief Announcement: (Near) Zero-Overhead {C++} Bindings for {MPI}
Brief Announcement: Scalable Distributed String Sorting
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory
Dismantling DivSufSort
Efficient Algorithms for the Maximum Common Subgraph Problem in Partial 2-Trees
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors
Engineering a Distributed Full-Text Index
Faster Block Tree Construction
Faster Wavelet Tree Queries
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI
Lightweight Distributed Suffix Array Construction
On Maximum Common Subgraph Problems in Series-Parallel Graphs
On Maximum Common Subgraph Problems in Series-Parallel Graphs
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
PaCHash: Packed and Compressed Hash Tables
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
Parallel Text Index Construction
Practical Performance of Space Efficient Data Structures for Longest Common Extensions
Practical Wavelet Tree Construction
SACABench: Benchmarking Suffix Array Construction
Scalable Construction of Text Indexes with Thrill
Scalable Text Index Construction
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
Space Efficient Construction of Lyndon Arrays in Linear Time
Open Source Software
Distributed Patricia Tries
Distributed Suffix Sorting
Distributed Wavelet Tree and Wavelet Matrix Construction
DivSuvSort with LCP
KaMPIng: Karlsruhe MPI next generation
Linear Time Lyndon Array Construction
PaCHash
Parallel RecSplit
Parallel Wavelet Trees and Wavelet Matrices
Practical Longest Common Extensions
Quad WT
SACABench: Benchmarking Suffix Array Construction
SIMD WT
Scalable Distributed Memory String Sorting
pasta::BitVector
pasta::BlockTree
Talks
2014 IWOCA
2016 CPM
2016 Workshop über Algorithmen und Komplexität (Theorietag)
2017 ALENEX
2017 PSC
2017 Workshop on Memory-Efficient Algorithms and their Application in Marine and Life Science
2018 ALENEX
2018 Workshop über Algorithmen und Komplexität (Theorietag)
2019 ALENEX
2019 SPIRE
2020 BwInf Workshop @ TU Dortmund
2020 ESA
2022 ACDA Workshop
2022 Final Meeting SPP Algorithms for Big Data
2022 Master O-Phase
2022 SPIRE
2023 ALENEX
2023 ESA
2024 DCC
Teaching
2020/21 Exercise Text Indexing and Information Retrieval
2020/21 Parallel Algorithms
2020/21 Presentation Skill Course
2021 Stringology Part of Algorithms II
2021 Text Indexing
2022 Advanced Data Structures
2022 Stringology Part of Algorithms II
2022 Text Indexing
2023 Advanced Data Structures
2023 Stringology Part of Algorithms II
2023 Text Indexing
2024 Advanced Data Structures
2024 Stringology Part of Algorithms II
2024 Text Indexing
Talks
2020 BwInf Workshop @ TU Dortmund
Slides presented at 2020 BwInf Workshop @ TU Dortmund: "Algorithm Engineering: Bit-Vektoren und Rank-Anfragen"
Preview
Download
slides (handout)
slides (animated)
