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
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
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)
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. 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. PDF
Bachelor's thesis; supervised by Nils Kriege and Petra Mutzel.