Clicking on any of the links below will redirect you to the abstract and details of my contributions.
The journalization of the results from DCFS’23 on alternating finite automata.
Matching Cartesian trees in the approximate setting, using the edit-distance approach. In computing the edit distance, we achieve a linear speedup compared to the conference version of the paper. The speedup is based on the fast computation of the max-min convolution between two monotonic arrays.
Solving the pattern mining problem for Simon’s congruence.
A venture down the theory of Cartesian trees from the approximate pattern matching perspective.
The journalized version of my second conference paper.
The journalized version of my first conference paper.
An extension of the pattern matching with variables and word equations problem under Simon’s congruence.
My first attempt at solving problems for alternating finite automata.
Another result on Simon’s congruence, this time between languages.
My second paper, and my first experience of an offline conference.
My first conference paper, possible from the support of three great professors.