Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
staff:ellert [2021-07-02 14:19] ellert [Publications] |
staff:ellert [2023-08-30 09:56] ellert [Publications] |
||
|---|---|---|---|
| Line 20: | Line 20: | ||
| ===== Publications ===== | ===== Publications ===== | ||
| - | My Erdős number is at most 3 (via E. Rotenberg -> C. Thomassen -> P. Erdős)! | + | My Erdős number is at most 3 (via E. Rotenberg -> C. Thomassen -> P. Erdős). |
| + | |||
| + | My Dijkstra number is at most 4 (via D. Köppl -> B. Möller -> C. A. R. Hoare -> E. W. Dijkstra). | ||
| === 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 in Sublinear Time**\\ //Hideo Bannai, Jonas Ellert//\\ ESA 2023, https://doi.org/10.4230/LIPIcs.ESA.2023.14 | ||
| + | * **Optimal Square Detection Over General Alphabets**\\ //Jonas Ellert, Paweł Gawrychowski, Garance Gourdel//\\ SODA 2023, https://doi.org/10.1137/1.9781611977554.ch189 | ||
| + | * **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//\\ To appear at ESA 2021 | + | **\\ //Nico Bertram, Jonas Ellert, Johannes Fischer//\\ ESA 2021, https://doi.org/10.4230/LIPIcs.ESA.2021.15, (contact me for the video presentation) |
| * **Linear Time Runs Over General Ordered Alphabets | * **Linear Time Runs Over General Ordered Alphabets | ||
| - | **\\ //Jonas Ellert, Johannes Fischer//\\ ICALP 2021, https://doi.org/10.4230/LIPIcs.ICALP.2021.63, ([[https://www.youtube.com/watch?v=bHbXVlb_EJ4|video presentation on YouTube]]) | + | **\\ //Jonas Ellert, Johannes Fischer//\\ ICALP 2021, https://doi.org/10.4230/LIPIcs.ICALP.2021.63, ([[https://www.youtube.com/watch?v=bHbXVlb_EJ4|video presentation on YouTube]]) ({{ :staff:ellert:ellert_runs_extended.pdf | extended talk}}) |
| * **LCP-Aware Parallel String Sorting**\\ //Jonas Ellert, Johannes Fischer, Nodari Sitchinava//\\ Euro-Par 2020, [[https://doi.org/10.1007/978-3-030-57675-2_21]], [[https://www.youtube.com/watch?v=J_Yel_3O72M|(video presentation on YouTube)]] | * **LCP-Aware Parallel String Sorting**\\ //Jonas Ellert, Johannes Fischer, Nodari Sitchinava//\\ Euro-Par 2020, [[https://doi.org/10.1007/978-3-030-57675-2_21]], [[https://www.youtube.com/watch?v=J_Yel_3O72M|(video presentation on YouTube)]] | ||
| * **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//\\ ICALP 2020, https://doi.org/10.4230/LIPIcs.ICALP.2020.14, [[https://doi.org/10.5446/49401|(video presentation on TIB)]] | * **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//\\ ICALP 2020, https://doi.org/10.4230/LIPIcs.ICALP.2020.14, [[https://doi.org/10.5446/49401|(video presentation on TIB)]] | ||