3 papers
cs.DS2026
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert +2
Many string processing problems can be phrased in the streaming setting, where the input arrives symbol by symbol and we have sublinear working space. The area of streaming algorit…
cs.DS2025
Small Space Encoding and Recognition of -Palindromic Prefixes
Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya
Palindromes are non-empty strings that read the same forward and backward. The problem of recognizing strings that can be represented as the concatenation of even-length palindrome…
cs.DS2024
Faster two-dimensional pattern matching with mismatches
Jonas Ellert, PaweŠGawrychowski, Adam Górkiewicz +1
The classical pattern matching asks for locating all occurrences of one string, called the pattern, in another, called the text, where a string is simply a sequence of characters.…