Jonas Ellert

According to our database, Jonas Ellert authored at least 16 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Efficient string algorithmics across alphabet realms.

Jonas Ellert

PhD thesis, 2024

2023

New Advances in Rightmost Lempel-Ziv.

Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen

Proceedings of the String Processing and Information Retrieval, 2023

Sublinear Time Lempel-Ziv (LZ77) Factorization.

Jonas Ellert

Proceedings of the String Processing and Information Retrieval, 2023

Optimal Square Detection Over General Alphabets.

Jonas Ellert, Pawel Gawrychowski, Garance Gourdel

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Lyndon Arrays in Sublinear Time.

Hideo Bannai, Jonas Ellert

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs.

Nico Bertram, Jonas Ellert, Johannes Fischer

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Lyndon Arrays Simplified.

Jonas Ellert

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Back-To-Front Online Lyndon Forest Construction.

Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

High-Quality Parallel Max-Cut Approximation Algorithms forShared Memory.

Nico Bertram, Jonas Ellert, Johannes Fischer

Proceedings of the Machine Learning under Resource Constraints - Volume 1: Fundamentals, 2022

2021

Practical Wavelet Tree Construction.

Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel

ACM J. Exp. Algorithmics, 2021

Linear Time Runs Over General Ordered Alphabets.

Jonas Ellert, Johannes Fischer

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Lyndon Words Accelerate Suffix Sorting.

Nico Bertram, Jonas Ellert, Johannes Fischer

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Space Efficient Construction of Lyndon Arrays in Linear Time.

Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

LCP-Aware Parallel String Sorting.

Jonas Ellert, Johannes Fischer, Nodari Sitchinava

Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019

Parallel External Memory Wavelet Tree and Wavelet Matrix Construction.

Jonas Ellert, Florian Kurpicz

Proceedings of the String Processing and Information Retrieval, 2019

Bidirectional Text Compression in External Memory.

Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck

Proceedings of the 27th Annual European Symposium on Algorithms, 2019