Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mika Hirvensalo
2010 – today
- 2013
[j21]Paul C. Bell, Vesa Halava, Mika Hirvensalo: Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundam. Inform. 123(1): 1-14 (2013)- 2012
- [j20]Nikita Gogin, Mika Hirvensalo: Recurrent Construction of MacWilliams and Chebyshev Matrices. Fundam. Inform. 116(1-4): 93-110 (2012)
- [j19]Mika Hirvensalo: On probabilistic and quantum reaction systems. Theor. Comput. Sci. 429: 134-143 (2012)
- [c12]Paul C. Bell, Mika Hirvensalo, Igor Potapov: Mortality for 2×2 Matrices Is NP-Hard. MFCS 2012: 148-159
- 2011
- [j18]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3) (2011)
- [c11]Mika Hirvensalo: Quantum Automata Theory - A Review. Algebraic Foundations in Computer Science 2011: 146-167
- [c10]
- 2010
- [j17]
- [c9]Paul Bell, Vesa Halava, Mika Hirvensalo: On the Joint Spectral Radius for Bounded Matrix Languages. RP 2010: 91-103
2000 – 2009
- 2009
- [j16]
- 2008
- [j15]Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki: Post Correspondence Problem for short words. Inf. Process. Lett. 108(3): 115-118 (2008)
- [c8]Mika Hirvensalo: Various Aspects of Finite Quantum Automata. Developments in Language Theory 2008: 21-33
- 2007
- [j14]Vesa Halava, Mika Hirvensalo: Improved matrix pair undecidability results. Acta Inf. 44(3-4): 191-205 (2007)
- [j13]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)
- [j12]
- [j11]Vesa Halava, Tero Harju, Mika Hirvensalo: Undecidability Bounds for Integer Matrices Using Claus Instances. Int. J. Found. Comput. Sci. 18(5): 931-948 (2007)
- [c7]Mika Hirvensalo: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. SOFSEM (1) 2007: 309-319
- 2006
- [j10]Vesa Halava, Tero Harju, Mika Hirvensalo: Positivity of second order linear recurrent sequences. Discrete Applied Mathematics 154(3): 447-451 (2006)
- 2004
- [c6]Mika Hirvensalo, Jyrki T. Lahtonen: On Self-Dual Bases of the Extensions of the Binary Field. Theory Is Forever 2004: 102-111
- 2003
- [j9]Mika Hirvensalo, Sebastian Seibert: Lower Bounds for Las Vegas Automata by Information Theory. ITA 37(1): 39-49 (2003)
- 2002
- [j8]
- [j7]
- [j6]Vesa Halava, Tero Harju, Mika Hirvensalo: Binary (generalized) Post Correspondence Problem. Theor. Comput. Sci. 276(1-2): 183-204 (2002)
- [j5]Mika Hirvensalo: Computing with quanta - impacts of quantum theory on computation. Theor. Comput. Sci. 287(1): 267-298 (2002)
- [c5]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
- 2001
- [j4]Mika Hirvensalo: Some Open Problems Related to Quantum Computing. Bulletin of the EATCS 74: 154-170 (2001)
- [j3]Vesa Halava, Mika Hirvensalo, Ronald de Wolf: Marked PCP is decidable. Theor. Comput. Sci. 255(1-2): 193-204 (2001)
- [p1]Mika Hirvensalo: An Introduction to Quantum Computing. Current Trends in Theoretical Computer Science 2001: 643-663
- 2000
- [j2]Vesa Halava, Tero Harju, Mika Hirvensalo: Generalized Post Correspondence Problem for Marked Morphisms. IJAC 10(6): 757-772 (2000)
1990 – 1999
- 1999
- [c4]Vesa Halava, Tero Harju, Mika Hirvensalo: Generalized PCP Is Decidable for Marked Morphisms. FCT 1999: 304-315
- [c3]Vesa Halava, Mika Hirvensalo, Ronald de Wolf: Decidability and Undecidability of Marked PCP. STACS 1999: 207-216
- 1998
- [j1]
- [c2]
- 1997
- [c1]Mika Hirvensalo: The Reversibility in Quantum Computation Theory. Developments in Language Theory 1997: 203-210
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-21 22:21 CEST by the dblp team