Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:ellert [2017-12-12 10:39] |
staff:ellert [2023-08-30 09:56] (current) Jonas Ellert [Publications] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ~~NOTOC~~ | ||
| ====== Jonas Ellert ====== | ====== Jonas Ellert ====== | ||
| - | {{ :staff:hiwi_jonas_ellert.jpg?nolink&200|}} | ||
| ===== Contact ===== | ===== Contact ===== | ||
| - | | Room: | R. 224 (guest office) in OH14 | | + | {{ :staff:ellert:thesis2.png?nolink&200|}} |
| - | | Phone: | +49 231 755 7748 (guest office) | | + | | Room: | R. 208, Otto-Hahn-Straße 14 | |
| + | | Phone: | 0231-755-7780 | | ||
| | E-Mail: | jonas.ellert{{:staff:at.gif|}}tu-dortmund.de| | | E-Mail: | jonas.ellert{{:staff:at.gif|}}tu-dortmund.de| | ||
| + | | Consultation hours: | on appointment | | ||
| ===== Projects ===== | ===== Projects ===== | ||
| + | * [[https://github.com/kurpicz/pwm|pwm]] - Parallel and external memory construction of Wavelet Trees and Matrices | ||
| * [[http://tudocomp.org/|tudocomp]] - Lossless Compression Framework | * [[http://tudocomp.org/|tudocomp]] - Lossless Compression Framework | ||
| + | |||
| + | |||
| + | ===== Teaching (in German) ===== | ||
| + | == Lehrveranstaltung == | ||
| + | * **Wintersemester 2019/2020** | ||
| + | * [[fischer:teaching:pg-plads|Projektgruppe 628: "C++-Template-Bibliothek für platzeffiziente Datenstrukturen"]] | ||
| + | |||
| + | ===== Publications ===== | ||
| + | |||
| + | 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 === | ||
| + | |||
| + | * **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 === | ||
| + | * **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 | ||
| + | **\\ //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 | ||
| + | **\\ //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)]] | ||
| + | * **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)]] | ||
| + | * **Parallel External Memory Wavelet Tree and Wavelet Matrix Construction**\\ //Jonas Ellert, Florian Kurpicz//\\ SPIRE 2019, https://doi.org/10.1007/978-3-030-32686-9_28 | ||
| + | * **Bidirectional Text Compression in External Memory**\\ //Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuk//\\ ESA 2019, https://doi.org/10.4230/LIPIcs.ESA.2019.41 | ||
| + | |||
| + | === Thesis Projects === | ||
| + | |||
| + | * **Efficient Computation of Nearest Smaller Suffixes.** {{ :staff:ellert:ellert-master-thesis.pdf | PDF}}\\ Winner of the **2020 FTI-Award for the best master's thesis** in computer science.\\ Master's thesis; supervised by Johannes Fischer and Florian Kurpicz | ||
| + | * **Matchings in bipartiten Graphen im Semi-Streaming Modell.** {{ :staff:ellert:ellert-bachelor-thesis.pdf | PDF}}\\ Bachelor's thesis; supervised by Nils Kriege and Petra Mutzel. | ||