Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:kurpicz [2019-08-06 13:08] |
staff:kurpicz [2019-10-08 19:57] |
||
---|---|---|---|
Line 56: | Line 56: | ||
===== Publications ===== | ===== Publications ===== | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
- | * **Parallel External Memory Wavelet Tree and Wavelet Matrix Construction**\\ //Jonas Ellert, Florian Kurpicz//\\ SPIRE 2019, to appear. | + | * **Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory**\\ //Patrick Dinklage, Johannes Fischer, Florian Kurpicz//\\ ALENEX 2020, to appear. |
- | * **SACABench: Benchmarking Suffix Array Construction**\\ //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, and Christopher Poeplau//\\ SPIRE 2019, to appear. | + | * **Parallel External Memory Wavelet Tree and Wavelet Matrix Construction**\\ //Jonas Ellert, Florian Kurpicz//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 407--416. |
+ | * **SACABench: Benchmarking Suffix Array Construction**\\ //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, and Christopher Poeplau//\\ Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), LNCS 11811, Springer, 392--406. | ||
* **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //Johannes Fischer, Florian Kurpicz//\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38. | * **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //Johannes Fischer, Florian Kurpicz//\\ Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38. | ||
* **[[https://doi.org/10.1109/BigData.2018.8622171|Scalable Construction of Text Indexes with Thrill]]** ([[https://arxiv.org/abs/1610.03007|preliminary arXiv preprint]])\\ //Timo Bingmann, Simon Gog, Florian Kurpicz//\\ Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634--643. | * **[[https://doi.org/10.1109/BigData.2018.8622171|Scalable Construction of Text Indexes with Thrill]]** ([[https://arxiv.org/abs/1610.03007|preliminary arXiv preprint]])\\ //Timo Bingmann, Simon Gog, Florian Kurpicz//\\ Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634--643. | ||
* **[[https://doi.org/10.1137/1.9781611975055.2|Simple, Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://arxiv.org/abs/1702.07578|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Marvin Löbel// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20. | * **[[https://doi.org/10.1137/1.9781611975055.2|Simple, Fast and Lightweight Parallel Wavelet Tree Construction]]** ([[https://arxiv.org/abs/1702.07578|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Marvin Löbel// \\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), 9--20. | ||
* **[[http://www.stringology.org/event/2017/p07.html|Dismantling DivSufSort]]** ([[https://arxiv.org/abs/1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76. | * **[[http://www.stringology.org/event/2017/p07.html|Dismantling DivSufSort]]** ([[https://arxiv.org/abs/1710.01896|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz// \\ Proceedings of the Prague Stringology Conference (PSC 2017), 62--76. | ||
- | * **[[http://dx.doi.org/10.1137/1.9781611974768.10|Engineering a Distributed Full-Text Index]]** ([[http://arxiv.org/abs/1610.03332|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Peter Sanders// \\ Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120--134 | + | * **[[http://dx.doi.org/10.1137/1.9781611974768.10|Engineering a Distributed Full-Text Index]]** ([[http://arxiv.org/abs/1610.03332|arXiv version]]) \\ //Johannes Fischer, Florian Kurpicz, Peter Sanders// \\ Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), 120--134. |
- | * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //Johannes Fischer, Dominik Köppl, Florian Kurpicz// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11 | + | * **[[http://dx.doi.org/10.4230/LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://arxiv.org/abs/1606.02465|arXiv version]]) \\ //Johannes Fischer, Dominik Köppl, Florian Kurpicz// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11. |
- | * **[[https://dx.doi.org/10.1007/978-3-319-19315-1_18|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://arxiv.org/abs/1708.02772|extended arXiv version]]) \\ //Nils Kriege, Florian Kurpicz, Petra Mutzel// \\ Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), LNCS 8986, Springer, 200--212 | + | * **[[https://dx.doi.org/10.1007/978-3-319-19315-1_18|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** ([[https://arxiv.org/abs/1708.02772|extended arXiv version]]) \\ //Nils Kriege, Florian Kurpicz, Petra Mutzel// \\ Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), LNCS 8986, Springer, 200--212. |
=== Journal Articles === | === Journal Articles === |