Mika Hirvensalo

mikhirve@utu.fi

+358 29 450 4325

+358 50 338 8034

Vesilinnantie 5

Turku

3 of 3

Positivity of second order linear recurrent sequences (2006)
- Discrete Applied Mathematics
Halava V, Harju T, Hirvensalo M
Binary (generalized) Post Correspondence Problem (2002)
- Theoretical Computer Science
Halava V, Harju T, Hirvensalo M
Marked PCP is decidable (2001)
- Theoretical Computer Science
Halava V, Hirvensalo M, de Wolf R
Generalized post correspondence problem for marked morphisms (2000)
- International Journal of Algebra and Computation
Halava V, Harju T, Hirvensalo M
Decidability and undecidability of marked PCP (1999)
- Lecture Notes in Computer Science
STACS'99 Halava V, Hirvensalo M, de Wolf R
Decidability and undecidability of marked PCP (1999) 16th Annual Symposium on Theoretical Aspects of Computer Science Halava V, Hirvensalo. M, de Wolf R
Generalized PCP is decidable for marked morphisms (1999)
- Lecture Notes in Computer Science
Halava V, Harju T, Hirvensalo M
Copying quantum computer makes NP-complete problems tractable (1998) Proceedings of MCU'98 Hirvensalo M
On Quantum Computation (1997) Hirvensalo Mika
The Reversibility in Quantum Computation Theory (1997) Proceedings of the 3rd International Conference Developments in Language Theory Hirvensalo M