Mika Hirvensalo

mikhirve@utu.fi

+358 29 450 4325

+358 50 338 8034

Vesilinnantie 5

Turku

4 of 6

Mortality for 2 × 2 Matrices is NP-hard. (2012)
- Lecture Notes in Computer Science
Mathematical Foudations of Computer Science 2012Mathematical Foundations of Computer Science 2012Mathematical Foundations of Computer Science 2012 Bell Paul, Hirvensalo Mika, Potapov Igor
On probabilistic and quantum reaction systems (2012)
- Theoretical Computer Science
Magic in Science Hirvensalo Mika
Quantum Automata Theory - A review. (2012)
- Lecture Notes in Computer Science
Algebraic Foundations in Computer Science Hirvensalo Mika
Recurrent Construction of MacWilliams and Chebyshev Matricesand Chebyshev Matrices (2012)
- Fundamenta Informaticae
Gogin Nikita, Hirvensalo Mika
Non-Classical Models of Automata and Applications II (2011)
- Fundamenta Informaticae
Bordihn Henning, Freund Rudolf, Hirvensalo Mika, Holzer Markus, Kutrib Martin, Otto Friedrich
Computing Partial Information out of Intractable: Powers of Algebraic Numbers as an Example (2010)
- Journal of Number Theory
Hirvensalo Mika, Karhumäki Juhani, Rabinovich Alexander
On the Joint Spectral Radius for Bounded Matrix Languages (2010)
- Lecture Notes in Computer Science
Bell Paul C, Halava Vesa, Hirvensalo Mika
Quantum Automata with Open Time Evolution (2010) Hirvensalo Mika
Post Correspondence Problem for short words (2008)
- Information Processing Letters
Halava V, Harju T, Hirvensalo M, Karhumaki J
Improved matrix pair undecidability results (2007)
- Acta Informatica
Halava V, Hirvensalo M