Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
fischer:publications [2021-01-14 09:30] Jonas Ellert [2020] |
fischer:publications [2021-02-18 09:43] Jonas Ellert [Peer Reviewed Publications] |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| ===== Peer Reviewed Publications ===== | ===== Peer Reviewed Publications ===== | ||
| + | ==== 2021 ==== | ||
| + | * **Linear Time Runs over General Ordered Alphabets | ||
| + | **\\ //**Jonas Ellert**, **Johannes Fischer**//\\ Submitted to ICALP 2021. ([[https://arxiv.org/abs/2102.08670|arXiv version]]) | ||
| ==== 2020 ==== | ==== 2020 ==== | ||
| * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. | * **Fostering Reflection in CS Teacher Education**\\ //**Johannes Fischer**, Nora Romahn, **Martin Weinert**//\\ Accepted at ISSEP'20. | ||
| Line 9: | Line 12: | ||
| * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Alexander Herlez**, Tomasz Kociumaka, **Florian Kurpicz**//\\ Proc. ESA, LIPICS 173, Article No. 39; pp. 39:1–39:20. | * **[[https://doi.org/10.4230/LIPIcs.ESA.2020.39|Practical Performance of Space Efficient Data Structures for Longest Common Extensions]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Alexander Herlez**, Tomasz Kociumaka, **Florian Kurpicz**//\\ Proc. ESA, LIPICS 173, Article No. 39; pp. 39:1–39:20. | ||
| * **[[https://dl.acm.org/doi/10.1145/3398681|Deterministic Sparse Suffix Sorting in the Restore Model]]**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ ACM Transactions on Algorithms 16(4), 50.1-50.53. | * **[[https://dl.acm.org/doi/10.1145/3398681|Deterministic Sparse Suffix Sorting in the Restore Model]]**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ ACM Transactions on Algorithms 16(4), 50.1-50.53. | ||
| - | * **[[https://doi.org/10.1007/978-3-030-57675-2_21|LCP-Aware Parallel String Sorting]]**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Proc. Euro-Par, LNCS 12247, 329–342. | + | * **[[https://doi.org/10.1007/978-3-030-57675-2_21|LCP-Aware Parallel String Sorting]]**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Proc. Euro-Par, LNCS 12247, 329–342. [[https://www.youtube.com/watch?v=J_Yel_3O72M|(video presentation on YouTube)]] |
| - | * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]**\\ //Philip Bille, **Jonas Ellert, Johannes Fischer**, Inge Li Gørtz, **Florian Kurpicz**, Ian Munro, Eva Rotenberg//\\ Proc. ICALP 2020, LIPIcs 168, 14:1-14.18. [[https://doi.org/10.5446/49401|(video presentation)]] | + | * **[[https://doi.org/10.4230/LIPIcs.ICALP.2020.14|Space Efficient Construction of Lyndon Arrays in Linear Time]]**\\ //Philip Bille, **Jonas Ellert, Johannes Fischer**, Inge Li Gørtz, **Florian Kurpicz**, Ian Munro, Eva Rotenberg//\\ Proc. ICALP 2020, LIPIcs 168, 14:1-14.18. [[https://doi.org/10.5446/49401|(video presentation on TIB)]] |
| * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 214-228. | * **[[https://doi.org/10.1137/1.9781611976007.17|Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory]]**\\ //**Patrick Dinklage**, **Johannes Fischer**, **Florian Kurpicz**//\\ Proceedings of the 22nd Workshop on Algorithm Engineering and Experiments (ALENEX 2019), 214-228. | ||