Avatar

Jonas Ellert  

Researcher in Computer Science

Paris, France

ellert.jonas gmail.com


Research Interests

  • String Algorithmics
  • Small-Space Algorithms
  • Compression
  • Bioinformatics

Languages

German

English

Italian



Awards

2025Best Paper Award at CPM
for the work Minimal Generators in Optimal Time
2023Best Paper Award at SPIRE
for the work New Advances in Rightmost Lempel-Ziv
2019FTI Award for the Best Computer Science Master’s Thesis in Germany
for the work Efficient Computation of Nearest Smaller Suffixes

Activities in the Scientific Community

Program Committee Membership
  • 2026: ALENEX, CPM
  • 2025: WABI, SPIRE, SeqBIM
  • 2024: ESA (Track B), WABI, SPIRE
Guest Editor of Topical Collection in Theory of Computing Systems
Advances in String Processing and Information Retrieval 2025
Invited Lecturer at CPM Summer School 2025
Aproximate Pattern Matching 101
Publications are listed here

Research Experience

Postdoctoral Researcher
ENS Paris, France, Département d'Informatique
Apr. 2024 - Mar. 2026

Research Associate
TU Dortmund, Germany, Chair of Algorithm Engineering
Independent Teaching:
  • Class Introduction to Programming (100 undergraduate students)
  • Project group on space-efficient data structures (8 graduate students)
  • Co-supervision of two Bachelor’s and four Master’s theses in algorithms
Aug. 2019 - Mar. 2024

Visiting Researcher
Université Gustave Eiffel, Marne-la-Vallée, France, Laboratoire d'Informatique Gaspard-Monge
Hosted by Maxime Crochemore under a PROCOPE Mobility Scholarship
Oct. 2021 - Nov. 2021

Student Assistant / Research Assistant
TU Dortmund, Germany, Chair of Algorithm Engineering (from Jan. 2018)
TU Dortmund, Germany, Chair of Dienstleistungsinformatik (until Dec. 2017)
Apr. 2016 - Jul. 2019


Education

Ph.D. in Computer Science
TU Dortmund, Germany, Summa Cum Laude
Dissertation: Efficient String Algorithmics Across Alphabet Realms
2019 - 2024

M.Sc. Computer Science (Specialization in Algorithmics)
TU Dortmund, Germany, With Honours
Thesis: Efficient Computation of Nearest Smaller Suffixes
2016 - 2019

B.Sc. Applied Computer Science
TU Dortmund, Germany
Thesis: Matchings in bipartiten Graphen im Semi-Streaming Modell
2012 - 2016