M. Hirvensalo

Most-cited papers

Quantum Computing
M. Hirvensalo
2001Natural Computing Series98 citations
Semantic Scholar
Quantum Computing and Quantum Information
M. Hirvensalo, A. Yakaryılmaz
201986 citations
Semantic Scholar
Quantum Automata with Open Time Evolution
M. Hirvensalo
2010International Journal of Natural Computing Research65 citations
Semantic Scholar
Undecidability Bounds for Integer Matrices Using Claus Instances
Vesa Halava, T. Harju, M. Hirvensalo
2007International Journal of Foundations of Computer Science49 citations
Semantic Scholar
Positivity of second order linear recurrent sequences
Vesa Halava, T. Harju, M. Hirvensalo
2006Discrete Applied Mathematics49 citations Open access
Semantic Scholar
Binary (generalized) Post Correspondence Problem
Vesa Halava, T. Harju, M. Hirvensalo
2002Theoretical Computer Science42 citations Open access
Semantic Scholar
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
M. Hirvensalo
2007Conference on Current Trends in Theory and Practice of Informatics40 citations
Semantic Scholar
Various Aspects of Finite Quantum Automata
M. Hirvensalo
2008International Conference on Developments in Language Theory38 citations
Semantic Scholar
Quantum Computing (Natural Computing Series)
M. Hirvensalo
200435 citations
Semantic Scholar
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete
Paul C. Bell, M. Hirvensalo, I. Potapov
2017ACM-SIAM Symposium on Discrete Algorithms34 citations Open access
Semantic Scholar
On the Generating Function of Discrete Chebyshev Polynomials
N. Gogin, M. Hirvensalo
201720 citations
Semantic Scholar
Marked PCP is decidable
Vesa Halava, M. Hirvensalo, R. de Wolf
2001Theoretical Computer Science19 citations Open access
Semantic Scholar
Mortality for 2×2 Matrices Is NP-Hard
Paul C. Bell, M. Hirvensalo, I. Potapov
2012International Symposium on Mathematical Foundations of Computer Science18 citations
Semantic Scholar
Generalized Post Correspondence Problem for Marked Morphisms
Vesa Halava, T. Harju, M. Hirvensalo
2000International journal of algebra and computation16 citations
Semantic Scholar
Improved matrix pair undecidability results
Vesa Halava, M. Hirvensalo
2007Acta Informatica12 citations
Semantic Scholar
On the computational power of affine automata
M. Hirvensalo, Etienne Moutot, A. Yakaryılmaz
2016Language and Automata Theory and Applications11 citations Open access
Semantic Scholar
On probabilistic and quantum reaction systems
M. Hirvensalo
2012Theoretical Computer Science11 citations Open access
Semantic Scholar
Quantum Automata Theory - A Review
M. Hirvensalo
2011Algebraic Foundations in Computer Science10 citations
Semantic Scholar
Quantum computing – Facts and folklore
M. Hirvensalo
2002Natural Computing10 citations
Semantic Scholar
Recurrent Construction of MacWilliams and Chebyshev Matrices
N. Gogin, M. Hirvensalo
2012Fundamenta Informaticae9 citations
Semantic Scholar
Quantum computing, Second Edition
M. Hirvensalo
2004Natural Computing Series9 citations
Semantic Scholar
Computing with quanta - impacts of quantum theory on computation
M. Hirvensalo
2002Theoretical Computer Science9 citations Open access
Semantic Scholar
Decidability and Undecidability of Marked PCP
Vesa Halava, M. Hirvensalo, R. de Wolf
1999Symposium on Theoretical Aspects of Computer Science8 citations
Semantic Scholar
Post Correspondence Problem for short words
Vesa Halava, T. Harju, M. Hirvensalo, J. Karhumäki
2008Information Processing Letters7 citations
Semantic Scholar
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example
M. Hirvensalo, J. Karhumäki
2002International Symposium on Mathematical Foundations of Computer Science7 citations
Semantic Scholar
Classical and quantum realtime alternating automata
H. G. Demirci, M. Hirvensalo, K. Reinhardt, A. C. Cem Say +1 more
2014Workshop on Non-Classical Models for Automata and Applications6 citations
Semantic Scholar
Computing partial information out of intractable: Powers of algebraic numbers as an example
M. Hirvensalo, J. Karhumäki, A. Rabinovich
20106 citations Open access
Semantic Scholar
Lower Bounds for Las Vegas Automata by Information Theory
M. Hirvensalo, Sebastian Seibert
2003RAIRO - Theoretical Informatics and Applications6 citations
Semantic Scholar
Interference as a computational resource: a tutorial
M. Hirvensalo
2017Natural Computing5 citations Open access
Semantic Scholar
Some Open Problems Related to Quantum Computing
M. Hirvensalo
2001Bull. EATCS5 citations
Semantic Scholar
Triangular Geometry Model for Ants Nodal Neutronics Solver
M. Hirvensalo, A. Rintala, V. Sahlberg
2021Mathematics and Computation 20214 citations
Semantic Scholar
On injectivity of quantum finite automata
Paul C. Bell, M. Hirvensalo
2019Journal of computer and system sciences (Print)4 citations Open access
Semantic Scholar
On Quantum Computation
M. Hirvensalo
19974 citations
Semantic Scholar
Computational limitations of affine automata and generalized affine automata
M. Hirvensalo, Etienne Moutot, A. Yakaryılmaz
2021Natural Computing3 citations Open access
Semantic Scholar
Mathematics for Quantum Information Processing
M. Hirvensalo
2012Handbook of Natural Computing3 citations
Semantic Scholar
Generalized PCP Is Decidable for Marked Morphisms
Vesa Halava, T. Harju, M. Hirvensalo
1999International Symposium on Fundamentals of Computation Theory3 citations
Semantic Scholar
Copying quantum computer makes NP-complete problems tractable
M. Hirvensalo
1998Machines, Computations, and Universality3 citations
Semantic Scholar
The Reversibility in Quantum Computation Theory
M. Hirvensalo
1997International Conference on Developments in Language Theory3 citations
Semantic Scholar
Acceptance Ambiguity for Quantum Automata
Paul C. Bell, M. Hirvensalo
2019International Symposium on Mathematical Foundations of Computer Science2 citations
Semantic Scholar
Computational Limitations of Affine Automata
M. Hirvensalo, Etienne Moutot, A. Yakaryılmaz
2019International Conference on Unconventional Computation and Natural Computation2 citations Open access
Semantic Scholar
Decision problems on unary probabilistic and quantum automata
M. Hirvensalo, A. Yakaryılmaz
2016Baltic Journal of Modern Computing2 citations Open access
Semantic Scholar
On the Generating Function of Discrete
N. Gogin, M. Hirvensalo
20072 citations
Semantic Scholar
EPR Paradox and Bell Inequalitites
M. Hirvensalo
2007Bull. EATCS2 citations
Semantic Scholar
Review: Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium
M. Hirvensalo
20042 citations
Semantic Scholar
Quantum and Biocomputing – Common Notions and Targets
M. Hirvensalo
20141 citations
Semantic Scholar
On the Joint Spectral Radius for Bounded Matrix Languages
Paul C. Bell, Vesa Halava, M. Hirvensalo
2010Reachability Problems1 citations
Semantic Scholar
Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007) ISBN 019857049X
M. Hirvensalo
2007Computer Science Review1 citations
Semantic Scholar
An Introduction to Quantum Computing, Phillip Kaye, Raymond Laflamme, Michele Mosca. Oxford University Press (2007), xii+276, Paperback $54, ISBN: 019857049X
M. Hirvensalo
20071 citations
Semantic Scholar
On Self-Dual Bases of the Extensions of the Binary Field
M. Hirvensalo, J. Lahtonen
2004Theory Is Forever1 citations
Semantic Scholar
An Introduction to Quantum Computing
M. Hirvensalo
2001Bull. EATCS1 citations
Semantic Scholar