| 2026 | STACS | An Improved Version of Hmelevskii's Theorem on Three-Variable Word Equations. | Aleksi Saarela |
| 2025 | DLT | Mapped Exponent and Asymptotic Critical Exponent of Words. | Eva Foster, Aleksi Saarela, Aleksi Vanhatalo |
| 2020 | ICALP | Hardness Results for Constant-Free Pattern Languages and Word Equations. | Aleksi Saarela |
| 2019 | DLT | Separating Many Words by Counting Occurrences of Factors. | Aleksi Saarela |
| 2018 | ICALP | An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. | Dirk Nowotka, Aleksi Saarela |
| 2017 | STACS | Word Equations Where a Power Equals a Product of Powers. | Aleksi Saarela |
| 2016 | DLT | Degrees of Infinite Words, Polynomials and Atoms. | Jrg Endrullis, Juhani Karhumki, Jan Willem Klop, Aleksi Saarela |
| 2016 | DLT | One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. | Dirk Nowotka, Aleksi Saarela |
| 2015 | CSR | On Growth and Fluctuation of k-Abelian Complexity. | Julien Cassaigne, Juhani Karhumki, Aleksi Saarela |
| 2014 | DLT | Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. | Juhani Karhumki, Aleksi Saarela, Luca Q. Zamboni |
| 2013 | DLT | 3-Abelian Cubes Are Avoidable on Binary Alphabets. | Robert Mercas, Aleksi Saarela |
| 2012 | DLT | Fine and Wilf's Theorem for k-Abelian Periods. | Juhani Karhumki, Svetlana Puzynina, Aleksi Saarela |
| 2009 | DLT | On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations. | Aleksi Saarela |
| 2008 | DLT | An Analysis and a Reproof of Hmelevskii's Theorem. | Juhani Karhumki, Aleksi Saarela |
| 2008 | WiMob | Random Beacon for Privacy and Group Security. | Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg |