Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Kurpicz
Person information
- affiliation: Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany
- affiliation (former, PhD 2020): Technical University of Dortmund, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c17]Florian Kurpicz
, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. ALENEX 2023: 162-175- [c16]Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Jan-Philipp Tarnowski:
Bit-Parallel (Compressed) Wavelet Tree Construction. DCC 2023: 81-90 - [c15]Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. ESA 2023: 19:1-19:16 - [c14]Dominik Köppl, Florian Kurpicz, Daniel Meyer:
Faster Block Tree Construction. ESA 2023: 74:1-74:20 - [i11]Matteo Ceregini, Florian Kurpicz, Rossano Venturini:
Faster Wavelet Trees with Quad Vectors. CoRR abs/2302.09239 (2023) - 2022
- [c13]Florian Kurpicz:
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. SPIRE 2022: 257-272 - [p1]Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders:
Scalable Text Index Construction. Algorithms for Big Data 2022: 252-284 - [i10]Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. CoRR abs/2205.04745 (2022) - [i9]Florian Kurpicz:
Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. CoRR abs/2206.01149 (2022) - [i8]Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. CoRR abs/2212.09562 (2022) - 2021
- [j2]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Practical Wavelet Tree Construction. ACM J. Exp. Algorithmics 26: 1.8:1-1.8:67 (2021) - 2020
- [b1]Florian Kurpicz:
Parallel text index construction. Technical University of Dortmund, Germany, 2020 - [c12]Patrick Dinklage, Johannes Fischer, Florian Kurpicz:
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. ALENEX 2020: 214-228 - [c11]Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz:
Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ESA 2020: 39:1-39:20 - [c10]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. ICALP 2020: 14:1-14:18
2010 – 2019
- 2019
- [c9]Johannes Fischer, Florian Kurpicz:
Lightweight Distributed Suffix Array Construction. ALENEX 2019: 27-38 - [c8]Jonas Ellert, Florian Kurpicz:
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction. SPIRE 2019: 392-406 - [c7]Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau:
SACABench: Benchmarking Suffix Array Construction. SPIRE 2019: 407-416 - [i7]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 2018
- [j1]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On maximum common subgraph problems in series-parallel graphs. Eur. J. Comb. 68: 79-95 (2018) - [c6]Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Simple, Fast and Lightweight Parallel Wavelet Tree Construction. ALENEX 2018: 9-20 - [c5]Timo Bingmann, Simon Gog, Florian Kurpicz:
Scalable Construction of Text Indexes with Thrill. IEEE BigData 2018: 634-643 - 2017
- [c4]Johannes Fischer, Florian Kurpicz, Peter Sanders:
Engineering a Distributed Full-Text Index. ALENEX 2017: 120-134 - [c3]Johannes Fischer, Florian Kurpicz:
Dismantling DivSufSort. Stringology 2017: 62-76 - [i6]Johannes Fischer, Florian Kurpicz:
Fast and Simple Parallel Wavelet Tree and Matrix Construction. CoRR abs/1702.07578 (2017) - [i5]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. CoRR abs/1708.02772 (2017) - [i4]Johannes Fischer, Florian Kurpicz:
Dismantling DivSufSort. CoRR abs/1710.01896 (2017) - 2016
- [c2]Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CPM 2016: 26:1-26:11 - [i3]Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CoRR abs/1606.02465 (2016) - [i2]Timo Bingmann, Simon Gog, Florian Kurpicz:
Scalable Construction of Text Indexes. CoRR abs/1610.03007 (2016) - [i1]Johannes Fischer, Florian Kurpicz, Peter Sanders:
Engineering a Distributed Full-Text Index. CoRR abs/1610.03332 (2016) - 2014
- [c1]Nils M. Kriege, Florian Kurpicz, Petra Mutzel:
On Maximum Common Subgraph Problems in Series-Parallel Graphs. IWOCA 2014: 200-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
