Master's Student in Informatics · Federal University of Paraná
→ Seeking PhD positions for Fall 2026I'm a theory-oriented computer scientist interested in combinatorial structures and the hunt for tight bounds. My work involves constructing extremal examples, finding structural invariants, and proving that natural upper bounds cannot be improved.
Currently, my research focuses on repetitiveness measures in strings. In particular, the relationship between combinatorial and compression-based complexity. But I'm broadly interested in problems where discrete structure meets computational constraints: data structure lower bounds, and the mathematics of efficient representation.
I work with Leandro Zatesko as part of the Theory Group at UFPR.
Combinatorics, stringology, compressed data structures, computational complexity.
On the near-tightness of χ ≤ 2r: a general σ-ary construction and a binary case via LFSRs
Exploring graph representation strategies for text classification
Um relato da experiência de construir um sistema para integração de dados e criação de indicadores para um programa governamental
Ranked 1st among MSc applicants from the Department of Informatics
UFPR Computer Science department representative
Teaching assistant at UFPR for algorithms and graph theory, including guest lectures on flow algorithms. Co-lectured an ICPC-style problem-solving course and coached a student team that qualified for the Brazilian national finals in 2024.