• HOME
• ABOUT US
  • Organization
  • Personnel
• NEWS&EVENTS
  • News & Events archive
  • Newsletter archive
  • Conference archive
  • Travel reports
• COOPERATION
  • International Involvement
  • National Involvement
  • Regional Involvement
• EDUCATION
  • Master's Programmes
  • TUCS Graduate Programmes
  • Information for Students
  • Courses
  • TUCS Short Courses
• PUBLICATIONS
  • TUCS Publication Series
  • How to Publish in TUCS Series
  • Publication Search
  • Publication Graph
  • Publication Input
  • Publication Input Guide
  • JuFo Browser
• RESEARCH
  • Focus areas
  • Research Programmes
  • Research Units
  • Distinguished Lectures

Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search

• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Department: Any ÅAU / Department of Information Technologies UTU / Department of Information Technology UTU / Department of Mathematics and Statistics UTU / Turku School of Economics, Institute of Information Systems Sciences

Research Unit: Any Algorithmics and Computational Intelligence Group (ACI) Biomathematics Research Unit (BIOMATH) Communication Systems (ComSys) Computational Biomodeling Laboratory (Combio Lab) Data Mining and Knowledge Management Laboratory Distributed Systems Laboratory (DS Lab) Embedded Computer and Electronic Systems (ECES) Embedded Systems Laboratory (ESLAB) FUNDIM, Fundamentals of Computing and Discrete Mathematics Institute for Advanced Management Systems Research (IAMSR) Learning and Reasoning Lab Software Construction Laboratorium Software Development Laboratory (SwDev) Software Engineering Laboratory (SE Lab) Turku BioNLP Group Turku Optimization Group (TOpGroup) UTU Information Systems Science (ISS)

Publication type: Any Monographs Edited books Edited special issues of journals Edited proceedings Articles in journals Articles in proceedings Chapters in edited books Ph.D. thesis Lic. thesis Technical reports

Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points AND Lastname, Firstname Year Title Abstract Keyword Points

Sort output by publication type Sort output by publication year

and display below and download in BibTeX and download as CSV and download as 2014-CSV

Monographs (2):

• Mika Hirvensalo, Quantum Computing. 2nd edition. Springer Series on Natural Computing, Springer, 2003.
• Mika Hirvensalo, Quantum Computing. 1st edition. Springer Series on Natural Computing, Springer, 2001.

Articles in journals (15):

• Paul C. Bell, Vesa Halava, Mika Hirvensalo, Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundamenta Informaticae 123(1), 1–14, 2013.
• Mika Hirvensalo, Juhani Karhumäki, Alexander Rabinovich, Computing Partial Information out of Intractable: Powers of Algebraic Numbers as an Example. Journal of Number Theory 130(2), 232–253 , 2010.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, Post Correspondence Problem for Short Words. Information Processing Letters 108(3), 115–118 , 2008.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Positivity of Second Order Linear Recurrent Sequences. Discrete Applied Mathematics 154(3), 447–451, 2006.
• Mika Hirvensalo, P vs NP. Dimensio (5), 16-20, 2004.
• Mika Hirvensalo, Tarinoita kvanttilaskennasta. Tietojenkäsittelytiede 19, 29-53, 2003.
• Mika Hirvensalo, Sebastian Seibert, Lower Bounds for Las Vegas Automata by Information Theory. Theoretical Informatics and Applications 37, 39-49, 2003.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Binary (generalized) Post Correspondence Problem. Theoretical Computer Science 1-2(276), 183–204, 2002.
• Mika Hirvensalo, Quantum Computing - Facts and Folklore. International Journal of Natural Computing (1), 135-155, 2002.
• Mika Hirvensalo, Computing with Quanta - Impacts of Quantum Theory on Computation. Theoretical Computer Science 1(287), 267–298, 2002.
• Mika Hirvensalo, Universality and Quantum Computing. Bulletin of the EATCS (78), 199-203, 2002.
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf, Marked PCP is decidable. Theoret. Comput. Sci. 255(1), 193-204, 2001.
• Mika Hirvensalo, Some Open Problems Related to Quantum Computing. Bulletin of the EATCS (74), 154-170, 2001.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized Post Correspondence Problem is decidable for marked morphisms. Internat. J. Algebra Comput. 10(6), (757-772), 2000.
• Mika Hirvensalo, An introduction to quantum computing. Bulletin of EATCS (66), 100-121, 1998.

Articles in proceedings (6):

• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, (G)PCP for words of length two. In: 9-ème Conférence Internationale Journées Montoises d'Informatique Théorique, 2002.
• Mika Hirvensalo, Juhani Karhumäki, Computing partial information out of intractable one - The first digit of 2^n at base 3 as an example. In: K. Diks, W. Rytter (Eds.), Mathematical Foundations of Computer Science 2002, LNCS 2420, 319-327, Springer, 2002.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized PCP is Decidable for Marked Morphisms. In: FCT'99, Fundamentals of Computation Theory, Lecture Notes in Computer Science 1684, 304–315, Springer, 1999.
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf, Decidability and Undecidability of Marked PCP. In: Sophie Tison Christoph Meinel (Ed.), STACS'99, Lecture Notes in Computer Science (LNCS) 1563, 207-216, Springer Verlag, 1999.
• Mika Hirvensalo, Copying quantum computer makes NP-complete problems tractable. In: IId International Colloquium Universal Machines and Computations, 2, 1-10, 1998.
• Mika Hirvensalo, The Reversibility in Quantum Computation Theory. In: Developments in Language Theory, 1997.

Chapters in edited books (3):

• Mika Hirvensalo, Some Open Problems Related to Quantum Computing. In: G. Rozenberg A. Salomaa G. Paun (Ed.), Current Trends in Theoretical Computer Science - The Challenge of the New Century Vol 1, World Scientific series in Computer Science, World Scientific, 2004.
• Mika Hirvensalo, Jyrki Lahtonen, On Self-dual Bases of the Extensions of the Binary Field. In: H. Maurer G. Paun G. Rozenberg J. Karhumäki (Ed.), Theory Is Forever: Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, LNCS 3113, 102–111, Springer, 2004.
• Mika Hirvensalo, An Introduction to Quantum Computing. In: G. Rozenberg A. Salomaa G. Paun (Ed.), Current Trends in Theoretical Computer Science - Entering the 21st Century, 643–663, World Scientific, 2001.

TUCS General Series (1):

• Mika Hirvensalo, Vesa Halava, Igor Potapov, Jarkko Kari (Eds.), Proceedings of the Satellite Workshops of DLT 2007, TUCS General Publication, Turku Centre for Computer Science, 2007.

Ph.D. thesis (1):

• Mika Hirvensalo, Studies on Boolean Functions Related to Quantum Computing. TUCS Dissertations 44. Turku Centre for Computer Science, 2003.

Licenciate thesis (1):

• Mika Hirvensalo, On Quantum Computation. 1997.

Technical reports (18):

• Nikita Gogin, Mika Hirvensalo, Recurrent Construction of MacWilliams and Chebyshev Matrices. TUCS Technical Reports 812, Turku Centre for Computer Science, 2007.
• Nikita Gogin, Mika Hirvensalo, On the Generating Function of Discrete Chebyshev Polynomials. TUCS Technical Reports 819, Turku Centre for Computer Science, 2007.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Undecidability Bounds for Integer Matrices using Claus Instances. TUCS Technical Reports 766, Turku Centre for Computer Science, 2006.
• Vesa Halava, Mika Hirvensalo, Improved Matrix Pair Undecidability Results. TUCS Technical Reports 799, Turku Centre for Computer Science, 2006.
• Mika Hirvensalo, Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. TUCS Technical Reports 769, Turku Centre for Computer Science, 2006.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Positivity of Second Order Linear Recurrent Sequences. TUCS Technical Reports 685, Turku Centre for Computer Science, 2005.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, Skolem's Problem - On the Border between Decidability and Undecidability. TUCS Technical Reports 683, Turku Centre for Computer Science, 2005.
• Mika Hirvensalo, A Method for Computing the Characteristic Polynomial and Determining Semidefiniteness. TUCS Technical Reports 727, Turku Centre for Computer Science, 2005.
• Mika Hirvensalo, Juhani Karhumäki, Alexander Rabinovich, Computing Partial Information out of Intractable: Powers of Algebraic Numbers as an Example. TUCS Technical Reports 651, Turku Centre for Computer Science, 2004.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki, (G)PCP for Words of Length at Most Two. TUCS Technical Reports 463, Turku Centre for Computer Science, 2002.
• Mika Hirvensalo, Juhani Karhumäki, Computing Partial Information Out of Uncomputable One - The first Digit of 2^n at Base 3 as an Example. TUCS Technical Reports 446, Turku Centre for Computer Science, 2002.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Binary (Generalized) Post Correspondence Problem. TUCS Technical Reports 357, Turku Centre for Computer Science, 2000.
• Mika Hirvensalo, Computing with Quanta - Impacts of Quantum Theory on Computation. TUCS Technical Reports 386, Turku Centre for Computer Science, 2000.
• Vesa Halava, Tero Harju, Mika Hirvensalo, Generalized PCP is Decidablefor Marked Morphisms. TUCS Technical Reports 283, Turku Centre for Computer Science, 1999.
• Vesa Halava, Mika Hirvensalo, Ronald de Wolf, Decidability and Undecidabilityof Marked PCP. TUCS Technical Reports 201, Turku Centre for Computer Science, 1998.
• Mika Hirvensalo, Copying quantum computer makes NP-complete problems tractable. TUCS Technical Reports 161, Turku Centre for Computer Science, 1998.
• Mika Hirvensalo, Quantum Error Correction. TUCS Technical Reports 178, Turku Centre for Computer Science, 1998.
• Mika Hirvensalo, On Quantum Computation. TUCS Technical Reports 111, Turku Centre for Computer Science, 1997.