Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
fischer:publications [2019-01-10 07:55] |
fischer:publications [2019-01-28 13:31] |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| ==== To Appear ==== | ==== To Appear ==== | ||
| * **Standards for Higher Secondary Education for Computer Science in Germany** \\ //**Arno Pasternak**, Lutz Hellmig and Gerhard Röhner//\\ Accepted at ISSEP'18. | * **Standards for Higher Secondary Education for Computer Science in Germany** \\ //**Arno Pasternak**, Lutz Hellmig and Gerhard Röhner//\\ Accepted at ISSEP'18. | ||
| - | * **Scalable Construction of Text Indexes with Thrill**\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**//\\ Accepted at IEEE Big Data '18 | ||
| ==== 2019 ==== | ==== 2019 ==== | ||
| - | * **[[https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.3|Lightweight Distributed Suffix Array Construction]]**\\ //**Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 27--38, 2019. | + | * **[[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, 2019. |
| * **[[https://www.sciencedirect.com/science/article/pii/S0304397518304493|Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes]]** ([[https://arxiv.org/abs/1802.10355|arXiv version]]) \\ //Tomohiro I, **Dominik Köppl**//\\ Theoretical Computer Science, 753: 1--15, 2019. | * **[[https://www.sciencedirect.com/science/article/pii/S0304397518304493|Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes]]** ([[https://arxiv.org/abs/1802.10355|arXiv version]]) \\ //Tomohiro I, **Dominik Köppl**//\\ Theoretical Computer Science, 753: 1--15, 2019. | ||
| ==== 2018 ==== | ==== 2018 ==== | ||
| + | * **[[https://doi.org/10.1109/BigData.2018.8622171|Scalable Construction of Text Indexes with Thrill]]** ([[https://arxiv.org/abs/1610.03007|arXiv version]])\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**//\\ Proceedings of the IEEE International Conference on Big Data (BigData 2018), 634--643, 2018. | ||
| * **[[http://dx.doi.org/10.1007/s00453-017-0348-7|Lempel-Ziv-78 Compressed String Dictionaries]]** ([[http://rdcu.be/uv3A|Nature SharedIt]]) \\ //Julian Arz, **Johannes Fischer**//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2012--2047, 2018. | * **[[http://dx.doi.org/10.1007/s00453-017-0348-7|Lempel-Ziv-78 Compressed String Dictionaries]]** ([[http://rdcu.be/uv3A|Nature SharedIt]]) \\ //Julian Arz, **Johannes Fischer**//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2012--2047, 2018. | ||
| * **[[http://dx.doi.org/10.1007/s00453-017-0333-1|Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees]]** ([[http://rdcu.be/utWN|Nature SharedIt]]) \\ //**Johannes Fischer**, Tomohiro I, **Dominik Köppl**, Kunihiko Sadakane//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2048--2081, 2018. | * **[[http://dx.doi.org/10.1007/s00453-017-0333-1|Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees]]** ([[http://rdcu.be/utWN|Nature SharedIt]]) \\ //**Johannes Fischer**, Tomohiro I, **Dominik Köppl**, Kunihiko Sadakane//\\ Algorithmica, Special Issue on Compact Data Structures, 80(7): 2048--2081, 2018. | ||