Mika Hirvensalo

According to our database1, Mika Hirvensalo
  • authored at least 43 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On the Computational Power of Affine Automata.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
Preface.
Fundam. Inform., 2016

Decision problems on unary probabilistic and quantum automata.
CoRR, 2016

On the computational power of affine automata.
CoRR, 2016

2015
Preface.
Fundam. Inform., 2015

2014
Classical and quantum realtime alternating automata.
CoRR, 2014

Classical and quantum realtime alternating automata.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

2013
Decision Problems for Probabilistic Finite Automata on Bounded Languages.
Fundam. Inform., 2013

2012
Mathematics for Quantum Information Processing.
Proceedings of the Handbook of Natural Computing, 2012

On probabilistic and quantum reaction systems.
Theor. Comput. Sci., 2012

Recurrent Construction of MacWilliams and Chebyshev Matrices.
Fundam. Inform., 2012

Mortality for 2×2 Matrices Is NP-Hard.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Preface.
Fundam. Inform., 2011

Quantum Information - A Tutorial.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Quantum Automata Theory - A Review.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Quantum Automata with Open Time Evolution.
IJNCR, 2010

On the Joint Spectral Radius for Bounded Matrix Languages.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009
Preface.
Theor. Comput. Sci., 2009

2008
Post Correspondence Problem for short words.
Inf. Process. Lett., 2008

Various Aspects of Finite Quantum Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Undecidability Bounds for Integer Matrices Using Claus Instances.
Int. J. Found. Comput. Sci., 2007

EPR Paradox and Bell Inequalitites.
Bulletin of the EATCS, 2007

Phillip Kaye, Raymond Laflamme and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007) ISBN 019857049X.
Computer Science Review, 2007

Improved matrix pair undecidability results.
Acta Inf., 2007

Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Positivity of second order linear recurrent sequences.
Discrete Applied Mathematics, 2006

2004
On Self-Dual Bases of the Extensions of the Binary Field.
Proceedings of the Theory Is Forever, 2004

2003
Lower Bounds for Las Vegas Automata by Information Theory.
ITA, 2003

2002
Computing with quanta - impacts of quantum theory on computation.
Theor. Comput. Sci., 2002

Binary (generalized) Post Correspondence Problem.
Theor. Comput. Sci., 2002

Quantum computing - Facts and folklore.
Natural Computing, 2002

Universality and Quantum Computing.
Bulletin of the EATCS, 2002

Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Marked PCP is decidable.
Theor. Comput. Sci., 2001

Some Open Problems Related to Quantum Computing.
Bulletin of the EATCS, 2001

An Introduction to Quantum Computing.
Current Trends in Theoretical Computer Science, 2001

2000
Generalized Post Correspondence Problem for Marked Morphisms.
IJAC, 2000

1999
Decidability and Undecidability of Marked PCP.
Proceedings of the STACS 99, 1999

Generalized PCP Is Decidable for Marked Morphisms.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
An Introduction to Quantum Computing.
Bulletin of the EATCS, 1998

Copying quantum computer makes NP-complete problems tractable.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
The Reversibility in Quantum Computation Theory.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997


  Loading...