Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
staff:ellert [2022-06-20 09:57] Jonas Ellert [Publications] |
staff:ellert [2023-08-30 09:56] (current) Jonas Ellert [Publications] |
||
|---|---|---|---|
| Line 29: | Line 29: | ||
| === Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
| - | * **Lyndon Arrays Simplified**\\ //Jonas Ellert//\\ Accepted at ESA 2022 | + | * **Lyndon Arrays in Sublinear Time**\\ //Hideo Bannai, Jonas Ellert//\\ ESA 2023, https://doi.org/10.4230/LIPIcs.ESA.2023.14 |
| - | * **A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs**\\ //Nico Bertram, Jonas Ellert, Johannes Fischer//\\ Accepted at SEA 2022. | + | * **Optimal Square Detection Over General Alphabets**\\ //Jonas Ellert, Paweł Gawrychowski, Garance Gourdel//\\ SODA 2023, https://doi.org/10.1137/1.9781611977554.ch189 |
| - | * **Back-to-Front Online Lyndon Forest Construction**\\ //Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert and Cyril Nicaud//\\ Accepted at CPM 2022. | + | * **Lyndon Arrays Simplified**\\ //Jonas Ellert//\\ ESA 2022, https://doi.org/10.4230/LIPIcs.ESA.2022.48 |
| + | * **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) | ||