Research
Combinatorics applied to computing. The problems change — genomes, circuits, ciphers, graphs — but the method is similar: find the algebraic or combinatorial structure behind the problem and use it to obtain better algorithms or tighter complexity bounds.
Genome rearrangement and bioinformatics
Sorting by transpositions, transposition distance and diameter, closest genome problems, and identification of haplotype blocks. This line produced the sequence of results on the 1.375-approximation algorithm for sorting by transpositions and, more recently, a barrier showing how far that family of techniques can go.
Related work: A barrier for further approximating sorting by transpositions (JCB, 2023); A new 1.375-approximation algorithm for sorting by transpositions (AMB, 2022); On the computational complexity of closest genome problems (DAM, 2020).
Reversible computing and circuit synthesis
Synthesis and optimization of reversible circuits — cycle representations of permutations, generalized Toffoli gates, Reed-Muller spectrum — and the quantum cost of the resulting constructions. The topic links group theory, Cayley graphs and circuit design.
Related work: Reversible circuit optimization using Reed-Muller spectrum and rules decomposition (LASCAS, 2025); A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates (JUCS, 2021); Reversible Karatsuba's algorithm (JUCS, 2006).
Quantum computing
Quantum algorithms and their classical analysis: quantum versions of Pollard's rho, minimum searching, element distinctness, and graph tessellation problems connected to quantum walks.
Related work: A quantum version of Pollard's rho of which Shor's algorithm is a particular case (COCOON, 2022); A computational complexity comparative study of graph tessellation problems (TCS, 2021).
Cryptography and cryptanalysis
GPU-accelerated cryptanalysis of block ciphers, homomorphic encryption applied to images, randomness in IoT products, and post-quantum cryptography. I lead the Cryptography and Information Security research group.
Related work: Implementing homomorphic encryption for image manipulation on GPU (CloudNet, 2024); Measuring randomness in IoT products (MetroInd4.0&IoT, 2019).
Discrete mathematics and graph theory
Total colouring of direct products of graphs, Cayley graphs as interconnection networks, Hamiltonian cycles in rearrangement graphs, and Lovász's conjecture.
Related work: On the total chromatic number of the direct product of cycles and complete graphs (RAIRO-OR, 2024); On total coloring the direct product of cycles and bipartite direct product of graphs (Discrete Mathematics, 2023).
Computing and music
Automatic emotion recognition in instrumental music and melody detection — machine learning applied to musical signals.
Related work: Emotion recognition in instrumental music using AI (BRACIS, 2024).
Collaboration
I am open to new collaborations and supervise students at every level. To discuss a topic, write through the contact form or come to room 502 at the Institute of Computing.