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 | ||
staff:ellert [2021-10-06 09:02] ellert [Publications] |
staff:ellert [2022-07-18 11:46] ellert [Publications] |
||
---|---|---|---|
Line 26: | Line 26: | ||
=== Refereed Journals === | === Refereed Journals === | ||
- | * **Practical Wavelet Tree Construction**\\ //Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel//\\ To appear in ACM J. Exp. Algor. | + | * **Practical Wavelet Tree Construction**\\ //Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel//\\ ACM J. Exp. Algor. 26(1), Article No.: 1.8, pp 1–67 |
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
+ | * **Lyndon Arrays Simplified**\\ //Jonas Ellert//\\ Accepted at ESA 2022 | ||
+ | * **A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs**\\ //Nico Bertram, Jonas Ellert, Johannes Fischer//\\ SEA 2022, https://doi.org/10.4230/LIPIcs.SEA.2022.10 | ||
+ | * **Back-to-Front Online Lyndon Forest Construction**\\ //Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert and Cyril Nicaud//\\ CPM 2022, https://doi.org/10.4230/LIPIcs.CPM.2022.13 | ||
* **Lyndon Words Accelerate Suffix Sorting | * **Lyndon Words Accelerate Suffix Sorting | ||
**\\ //Nico Bertram, Jonas Ellert, Johannes Fischer//\\ ESA 2021, https://doi.org/10.4230/LIPIcs.ESA.2021.15, (contact me for the video presentation) | **\\ //Nico Bertram, Jonas Ellert, Johannes Fischer//\\ ESA 2021, https://doi.org/10.4230/LIPIcs.ESA.2021.15, (contact me for the video presentation) |