Jonas Ellert

30 papers A* 4A 6B 4C 3Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
Approximate Cartesian Tree Matching with Substitutions.
STACS
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
2026 J jnl
Approximate Cartesian Tree Matching with Substitutions.
CoRR
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
2026 A conf
Time-Optimal Construction of String Synchronizing Sets.
STACS
Jonas Ellert, Tomasz Kociumaka
2026 J jnl
Time-Optimal Construction of String Synchronizing Sets.
CoRR
Jonas Ellert, Tomasz Kociumaka
2025 A* conf
Faster two-dimensional pattern matching with
SODA
Jonas Ellert, Pawel Gawrychowski, Adam Górkiewicz, Tatiana Starikovskaya
2025 B conf
Minimal Generators in Optimal Time.
CPM
Jonas Ellert, Pawel Gawrychowski, Tatiana Starikovskaya
2025 B conf
Small Space Encoding and Recognition of k-Palindromic Prefixes.
ISAAC
Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya
2024 — —
Efficient string algorithmics across alphabet realms.
Jonas Ellert
2024 J jnl
Faster two-dimensional pattern matching with
CoRR
Jonas Ellert, Pawel Gawrychowski, Adam Górkiewicz, Tatiana Starikovskaya
2024 J jnl
Small Space Encoding and Recognition of
CoRR
Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya
2023 A conf
Lyndon Arrays in Sublinear Time.
ESA
Hideo Bannai, Jonas Ellert
2023 C conf
New Advances in Rightmost Lempel-Ziv.
SPIRE
Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen
2023 A* conf
Optimal Square Detection Over General Alphabets.
SODA
Jonas Ellert, Pawel Gawrychowski, Garance Gourdel
2023 J jnl
Optimal Square Detection Over General Alphabets.
CoRR
Jonas Ellert, Pawel Gawrychowski, Garance Gourdel
2023 C conf
Sublinear Time Lempel-Ziv (LZ77) Factorization.
SPIRE
Jonas Ellert
2022 B conf
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs.
SEA
Nico Bertram, Jonas Ellert, Johannes Fischer
2022 B conf
Back-To-Front Online Lyndon Forest Construction.
CPM
Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud
2022 — ch.
High-Quality Parallel Max-Cut Approximation Algorithms forShared Memory.
Mach. Learn. under Resour. Constraints Vol. 1 (1)
Nico Bertram, Jonas Ellert, Johannes Fischer
2022 A conf
Lyndon Arrays Simplified.
ESA
Jonas Ellert
2021 A* conf
Linear Time Runs Over General Ordered Alphabets.
ICALP
Jonas Ellert, Johannes Fischer
2021 J jnl
Linear Time Runs over General Ordered Alphabets.
CoRR
Jonas Ellert, Johannes Fischer
2021 A conf
Lyndon Words Accelerate Suffix Sorting.
ESA
Nico Bertram, Jonas Ellert, Johannes Fischer
2021 J jnl
Practical Wavelet Tree Construction.
ACM J. Exp. Algorithmics
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel
2020 — conf
LCP-Aware Parallel String Sorting.
Euro-Par
Jonas Ellert, Johannes Fischer, Nodari Sitchinava
2020 J jnl
LCP-Aware Parallel String Sorting.
CoRR
Jonas Ellert, Johannes Fischer, Nodari Sitchinava
2020 A* conf
Space Efficient Construction of Lyndon Arrays in Linear Time.
ICALP
Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg
2019 A conf
Bidirectional Text Compression in External Memory.
ESA
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
2019 J jnl
Bidirectional Text Compression in External Memory.
CoRR
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
2019 C conf
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction.
SPIRE
Jonas Ellert, Florian Kurpicz
2019 J jnl
Space Efficient Construction of Lyndon Arrays in Linear Time.
CoRR
Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg