Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
fischer:publications [2019-06-24 08:41] |
fischer:publications [2019-06-24 08:44] |
||
|---|---|---|---|
| Line 6: | Line 6: | ||
| ==== 2019 ==== | ==== 2019 ==== | ||
| - | * **Bidirectional Text Compression in External Memory**\\ | + | * **Bidirectional Text Compression in External Memory**\\ //**Patrick Dinklage, Jonas Ellert, Johannes Fischer**, Dominik Köppl, Manuel Penschuk//\\ ESA 2019, to appear. |
| - | // **Patrick Dinklage, Jonas Ellert, Johannes Fischer**, Dominik Köppl, Manuel Penschuk//\\ | + | |
| - | ESA 2019, to appear | + | |
| * **[[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://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. | ||