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 [2020-06-29 12:16] Johannes Fischer [2020] |
fischer:publications [2020-07-07 18:56] Florian Kurpicz [Other Publications and Preprints] |
||
---|---|---|---|
Line 8: | Line 8: | ||
* **Deterministic Sparse Suffix Sorting in the Restore Model**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ Accepted to ACM Trans. Algorithms. | * **Deterministic Sparse Suffix Sorting in the Restore Model**\\ //**Johannes Fischer, Tomohiro I, Dominik Köppl**//\\ Accepted to ACM Trans. Algorithms. | ||
* **LCP-Aware Parallel String Sorting**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Accepted to Euro-Par. | * **LCP-Aware Parallel String Sorting**\\ //**Jonas Ellert, Johannes Fischer**, Nodari Sitchinava//\\ Accepted to Euro-Par. | ||
- | * **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. [[http://arxiv.org/abs/1911.03542|(arXiv version)]] | + | * **[[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. [[http://arxiv.org/abs/1911.03542|(arXiv version)]] |
* **[[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. | ||
Line 86: | Line 86: | ||
===== Other Publications and Preprints ===== | ===== Other Publications and Preprints ===== | ||
- | * **[[https://arxiv.org/abs/1911.03542|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//\\ | + | * **[[https://dx.doi.org/10.17877/DE290R-21114|Parallel Text Index Construction]]**\\ //**Florian Kurpicz**// \\ PhD-Thesis, 2018. |
* **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018. | * **[[http://dx.doi.org/10.17877/DE290R-19051|Exploring Regular Structures in Strings]]**\\ //**Dominik Köppl**// \\ PhD-Thesis, 2018. | ||
- | * **[[https://arxiv.org/abs/1610.03007|Scalable Construction of Text Indexes]]**\\ //Timo Bingmann, Simon Gog, **Florian Kurpicz**// \\ | ||
- |