| Publication | Date of Publication | Type |
|---|
| The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete | 2024-01-18 | Paper |
| Interference as a computational resource: a tutorial | 2023-11-30 | Paper |
| Correction to: ``Computational limitations of affine automata and generalized affine automata | 2023-09-08 | Paper |
| Computational limitations of affine automata and generalized affine automata | 2023-09-08 | Paper |
| Acceptance Ambiguity for Quantum Automata | 2022-07-21 | Paper |
| A Riemann hypothesis analog for the Krawtchouk and discrete Chebyshev polynomials | 2022-06-16 | Paper |
| On injectivity of quantum finite automata | 2021-09-17 | Paper |
| Computational limitations of affine automata | 2019-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232904 | 2019-09-13 | Paper |
| The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete | 2018-07-16 | Paper |
| On the generating function of discrete Chebyshev polynomials | 2017-10-04 | Paper |
| On the Computational Power of Affine Automata | 2017-06-01 | Paper |
| Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing | 2014-10-07 | Paper |
| Decision Problems for Probabilistic Finite Automata on Bounded Languages | 2013-04-18 | Paper |
| Mortality for 2 ×2 Matrices Is NP-Hard | 2012-09-25 | Paper |
| Recurrent construction of MacWilliams and Chebyshev matrices | 2012-06-20 | Paper |
| On probabilistic and quantum reaction systems | 2012-05-30 | Paper |
| Quantum Automata Theory – A Review | 2011-11-11 | Paper |
| Quantum Information – A Tutorial | 2011-06-17 | Paper |
| UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES | 2011-01-06 | Paper |
| On the Joint Spectral Radius for Bounded Matrix Languages | 2010-08-31 | Paper |
| Post correspondence problem for short words | 2010-06-09 | Paper |
| Computing partial information out of intractable: powers of algebraic numbers as an example | 2010-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396618 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395950 | 2009-09-15 | Paper |
| Various Aspects of Finite Quantum Automata | 2008-10-30 | Paper |
| Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages | 2008-03-07 | Paper |
| Improved matrix pair undecidability results | 2007-08-17 | Paper |
| Positivity of second order linear recurrent sequences | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668742 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668741 | 2005-04-15 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Lower Bounds for Las Vegas Automata by Information Theory | 2004-05-18 | Paper |
| Quantum computing. | 2004-03-28 | Paper |
| Some open problems related to quantum computing | 2003-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708580 | 2003-06-18 | Paper |
| Computing with quanta -- impacts of quantum theory on computation. | 2003-01-21 | Paper |
| Quantum computing -- facts and folklore | 2002-08-20 | Paper |
| Binary (generalized) Post Correspondence Problem | 2002-07-15 | Paper |
| Marked PCP is decidable | 2001-08-20 | Paper |
| Generalized Post correspondence problem for marked morphisms | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790417 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934339 | 2000-10-03 | Paper |
| Quantum computing | 2000-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251052 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223780 | 1999-05-04 | Paper |
