| 2019 | MFCS | Acceptance Ambiguity for Quantum Automata. | Paul C. Bell, Mika Hirvensalo |
| 2019 | UC | Computational Limitations of Affine Automata. | Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz |
| 2017 | LATA | On the Computational Power of Affine Automata. | Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz |
| 2017 | SODA | The Identity Problem for Matrix Semigroups in SL | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
| 2012 | MFCS | Mortality for 22 Matrices Is NP-Hard. | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
| 2011 | UC | Quantum Information - A Tutorial. | Mika Hirvensalo |
| 2008 | DLT | Various Aspects of Finite Quantum Automata. | Mika Hirvensalo |
| 2007 | SOFSEM | Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. | Mika Hirvensalo |
| 2002 | MFCS | Computing Partial Information out of Intractable One - The First Digit of 2 | Mika Hirvensalo, Juhani Karhumki |
| 1999 | FCT | Generalized PCP Is Decidable for Marked Morphisms. | Vesa Halava, Tero Harju, Mika Hirvensalo |
| 1999 | STACS | Decidability and Undecidability of Marked PCP. | Vesa Halava, Mika Hirvensalo, Ronald de Wolf |
| 1998 | MCU | Copying quantum computer makes NP-complete problems tractable. | Mika Hirvensalo |
| 1997 | DLT | The Reversibility in Quantum Computation Theory. | Mika Hirvensalo |