| Quantum computing M Hirvensalo Springer Science & Business Media, 2013 | 598 | 2013 |
| Skolem’s problem–on the border between decidability and undecidability V Halava, T Harju, M Hirvensalo, J Karhumäki TUCS Technical Reports 683, 2005 | 130 | 2005 |
| Positivity of second order linear recurrent sequences V Halava, T Harju, M Hirvensalo Discrete Applied Mathematics 154 (3), 447-451, 2006 | 67 | 2006 |
| Quantum automata with open time evolution M Hirvensalo Nature-Inspired Computing Design, Development, and Applications, 74-89, 2012 | 66 | 2012 |
| Undecidability bounds for integer matrices using Claus instances V Halava, T Harju, M Hirvensalo International Journal of Foundations of Computer Science 18 (05), 931-948, 2007 | 62 | 2007 |
| Binary (generalized) Post correspondence problem V Halava, T Harju, M Hirvensalo Theoretical computer science 276 (1-2), 183-204, 2002 | 49 | 2002 |
| Various aspects of finite quantum automata M Hirvensalo International Conference on Developments in Language Theory, 21-33, 2008 | 39 | 2008 |
| Improved undecidability results on the emptiness problem of probabilistic and quantum cut-point languages M Hirvensalo International Conference on Current Trends in Theory and Practice of …, 2007 | 38 | 2007 |
| The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete PC Bell, M Hirvensalo, I Potapov Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 36 | 2017 |
| On the generating function of discrete Chebyshev polynomials N Gogin, M Hirvensalo Journal of Mathematical Sciences 224 (2), 250-257, 2017 | 34 | 2017 |
| Mortality for 2× 2 matrices is NP-hard PC Bell, M Hirvensalo, I Potapov Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 29 | 2012 |
| Marked PCP is decidable V Halava, M Hirvensalo, R de Wolf Theoretical Computer Science 255 (1-2), 193-204, 2001 | 23 | 2001 |
| Improved matrix pair undecidability results V Halava, M Hirvensalo Acta Informatica 44 (3), 191-205, 2007 | 16 | 2007 |
| Generalized Post correspondence problem for marked morphisms V Halava, T Harju, M Hirvensalo International Journal of Algebra and Computation 10 (06), 757-772, 2000 | 16 | 2000 |
| On quantum computation M Hirvensalo Turku Centre for Computer Science, 1997 | 16 | 1997 |
| On probabilistic and quantum reaction systems M Hirvensalo Theoretical Computer Science 429, 134-143, 2012 | 15 | 2012 |
| Recurrent construction of MacWilliams and Chebyshev matrices N Gogin, M Hirvensalo Fundamenta Informaticae 116 (1-4), 93-110, 2012 | 14 | 2012 |
| Studies on Boolean functions related to quantum computing M Hirvensalo University of Turku, 2003 | 14 | 2003 |
| An introduction to quantum computing M Hirvensalo Current trends in theoretical computer science: entering the 21st centuary …, 2001 | 14 | 2001 |
| On the computational power of affine automata M Hirvensalo, E Moutot, A Yakaryılmaz International Conference on Language and Automata Theory and Applications …, 2017 | 13 | 2017 |
