| 2009 |
|---|
| 24 | EE | Mika Hirvensalo:
Preface.
Theor. Comput. Sci. 410(20): 1915 (2009) |
| 2008 |
|---|
| 23 | EE | Mika Hirvensalo:
Various Aspects of Finite Quantum Automata.
Developments in Language Theory 2008: 21-33 |
| 22 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo,
Juhani Karhumäki:
Post Correspondence Problem for short words.
Inf. Process. Lett. 108(3): 115-118 (2008) |
| 2007 |
|---|
| 21 | EE | Mika Hirvensalo:
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages.
SOFSEM (1) 2007: 309-319 |
| 20 | EE | Vesa Halava,
Mika Hirvensalo:
Improved matrix pair undecidability results.
Acta Inf. 44(3-4): 191-205 (2007) |
| 19 | EE | Mika Hirvensalo:
Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007) ISBN 019857049X.
Computer Science Review 1(1): 73-76 (2007) |
| 18 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci. 18(5): 931-948 (2007) |
| 2006 |
|---|
| 17 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Positivity of second order linear recurrent sequences.
Discrete Applied Mathematics 154(3): 447-451 (2006) |
| 2004 |
|---|
| 16 | EE | Mika Hirvensalo,
Jyrki T. Lahtonen:
On Self-Dual Bases of the Extensions of the Binary Field.
Theory Is Forever 2004: 102-111 |
| 2003 |
|---|
| 15 | EE | Mika Hirvensalo,
Sebastian Seibert:
Lower Bounds for Las Vegas Automata by Information Theory.
ITA 37(1): 39-49 (2003) |
| 2002 |
|---|
| 14 | EE | Mika Hirvensalo,
Juhani Karhumäki:
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.
MFCS 2002: 319-327 |
| 13 | | Mika Hirvensalo:
Universality and Quantum Computing.
Bulletin of the EATCS 78: 199-203 (2002) |
| 12 | | Mika Hirvensalo:
Quantum computing - Facts and folklore.
Natural Computing 1(1): 135-155 (2002) |
| 11 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci. 276(1-2): 183-204 (2002) |
| 10 | | Mika Hirvensalo:
Computing with quanta - impacts of quantum theory on computation.
Theor. Comput. Sci. 287(1): 267-298 (2002) |
| 2001 |
|---|
| 9 | | Mika Hirvensalo:
An Introduction to Quantum Computing.
Current Trends in Theoretical Computer Science 2001: 643-663 |
| 8 | | Mika Hirvensalo:
Some Open Problems Related to Quantum Computing.
Bulletin of the EATCS 74: 154-170 (2001) |
| 7 | EE | Vesa Halava,
Mika Hirvensalo,
Ronald de Wolf:
Marked PCP is decidable.
Theor. Comput. Sci. 255(1-2): 193-204 (2001) |
| 2000 |
|---|
| 6 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Generalized Post Correspondence Problem for Marked Morphisms.
IJAC 10(6): 757-772 (2000) |
| 1999 |
|---|
| 5 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo:
Generalized PCP Is Decidable for Marked Morphisms.
FCT 1999: 304-315 |
| 4 | EE | Vesa Halava,
Mika Hirvensalo,
Ronald de Wolf:
Decidability and Undecidability of Marked PCP.
STACS 1999: 207-216 |
| 1998 |
|---|
| 3 | | Mika Hirvensalo:
Copying quantum computer makes NP-complete problems tractable.
MCU (2) 1998: 1-10 |
| 2 | | Mika Hirvensalo:
An Introduction to Quantum Computing.
Bulletin of the EATCS 66: 100-121 (1998) |
| 1997 |
|---|
| 1 | | Mika Hirvensalo:
The Reversibility in Quantum Computation Theory.
Developments in Language Theory 1997: 203-210 |
