default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonas Ellert
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Jonas Ellert:
Efficient string algorithmics across alphabet realms. Technical University of Dortmund, Germany, 2024- 2023
- [c13]Hideo Bannai, Jonas Ellert:
Lyndon Arrays in Sublinear Time. ESA 2023: 14:1-14:16 - [c12]Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. SODA 2023: 5220-5242 - [c11]Jonas Ellert
:
Sublinear Time Lempel-Ziv (LZ77) Factorization. SPIRE 2023: 171-187 - [c10]Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen:
New Advances in Rightmost Lempel-Ziv. SPIRE 2023: 188-202 - [i5]Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. CoRR abs/2303.07229 (2023) - 2022
- [c9]Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud:
Back-To-Front Online Lyndon Forest Construction. CPM 2022: 13:1-13:23 - [c8]Jonas Ellert:
Lyndon Arrays Simplified. ESA 2022: 48:1-48:14 - [c7]Nico Bertram, Jonas Ellert, Johannes Fischer:
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. SEA 2022: 10:1-10:15 - [p1]Nico Bertram, Jonas Ellert, Johannes Fischer:
High-Quality Parallel Max-Cut Approximation Algorithms forShared Memory. Mach. Learn. under Resour. Constraints Vol. 1 (1) 2022: 144-159 - 2021
- [j1]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Practical Wavelet Tree Construction. ACM J. Exp. Algorithmics 26: 1.8:1-1.8:67 (2021) - [c6]Nico Bertram, Jonas Ellert, Johannes Fischer:
Lyndon Words Accelerate Suffix Sorting. ESA 2021: 15:1-15:13 - [c5]Jonas Ellert, Johannes Fischer:
Linear Time Runs Over General Ordered Alphabets. ICALP 2021: 63:1-63:16 - [i4]Jonas Ellert, Johannes Fischer:
Linear Time Runs over General Ordered Alphabets. CoRR abs/2102.08670 (2021) - 2020
- [c4]Jonas Ellert, Johannes Fischer, Nodari Sitchinava:
LCP-Aware Parallel String Sorting. Euro-Par 2020: 329-342 - [c3]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [i3]Jonas Ellert, Johannes Fischer, Nodari Sitchinava:
LCP-Aware Parallel String Sorting. CoRR abs/2006.02219 (2020)
2010 – 2019
- 2019
- [c2]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck:
Bidirectional Text Compression in External Memory. ESA 2019: 41:1-41:16 - [c1]Jonas Ellert, Florian Kurpicz:
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction. SPIRE 2019: 392-406 - [i2]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck:
Bidirectional Text Compression in External Memory. CoRR abs/1907.03235 (2019) - [i1]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-11 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
