| Publication | Date of Publication | Type |
|---|
The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
Information and Computation | 2024-01-18 | Paper |
Interference as a computational resource: a tutorial
Natural Computing | 2023-11-30 | Paper |
Correction to: ``Computational limitations of affine automata and generalized affine automata
Natural Computing | 2023-09-08 | Paper |
Computational limitations of affine automata and generalized affine automata
Natural Computing | 2023-09-08 | Paper |
| Acceptance Ambiguity for Quantum Automata | 2022-07-21 | Paper |
A Riemann hypothesis analog for the Krawtchouk and discrete Chebyshev polynomials
Journal of Mathematical Sciences (New York) | 2022-06-16 | Paper |
On injectivity of quantum finite automata
Journal of Computer and System Sciences | 2021-09-17 | Paper |
Computational limitations of affine automata
(available as arXiv preprint) | 2019-10-10 | Paper |
scientific article; zbMATH DE number 7104930 (Why is no real title available?)
(available as arXiv preprint) | 2019-09-13 | Paper |
The identity problem for matrix semigroups in \(\mathrm{SL}_2(\mathbb{Z})\) is NP-complete
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the generating function of discrete Chebyshev polynomials
Journal of Mathematical Sciences (New York) | 2017-10-04 | Paper |
On the computational power of affine automata
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Book review of: Phillip Kaye, Raymond Laflamme, Michele Mosca, An introduction to quantum computing
Computer Science Review | 2014-10-07 | Paper |
Decision problems for probabilistic finite automata on bounded languages
Fundamenta Informaticae | 2013-04-18 | Paper |
Mortality for \(2 \times 2\) matrices is NP-hard
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Recurrent construction of MacWilliams and Chebyshev matrices
Fundamenta Informaticae | 2012-06-20 | Paper |
On probabilistic and quantum reaction systems
Theoretical Computer Science | 2012-05-30 | Paper |
Quantum automata theory -- a review
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
Quantum information -- a tutorial
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Undecidability bounds for integer matrices using Claus instances
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
On the joint spectral radius for bounded matrix languages
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Post correspondence problem for short words
Information Processing Letters | 2010-06-09 | Paper |
Computing partial information out of intractable: powers of algebraic numbers as an example
Journal of Number Theory | 2010-01-08 | Paper |
| scientific article; zbMATH DE number 5605120 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5604067 (Why is no real title available?) | 2009-09-15 | Paper |
Various Aspects of Finite Quantum Automata
Developments in Language Theory | 2008-10-30 | Paper |
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Improved matrix pair undecidability results
Acta Informatica | 2007-08-17 | Paper |
Positivity of second order linear recurrent sequences
Discrete Applied Mathematics | 2006-04-28 | Paper |
| scientific article; zbMATH DE number 2156284 (Why is no real title available?) | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2156283 (Why is no real title available?) | 2005-04-15 | Paper |
Theory Is Forever
Lecture Notes in Computer Science | 2005-01-18 | Paper |
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
Lower Bounds for Las Vegas Automata by Information Theory
RAIRO - Theoretical Informatics and Applications | 2004-05-18 | Paper |
Quantum computing.
Natural Computing Series | 2004-03-28 | Paper |
Some open problems related to quantum computing
Bulletin of the European Association for Theoretical Computer Science EATCS | 2003-09-11 | Paper |
| scientific article; zbMATH DE number 1929948 (Why is no real title available?) | 2003-06-18 | Paper |
Computing with quanta -- impacts of quantum theory on computation.
Theoretical Computer Science | 2003-01-21 | Paper |
Quantum computing -- facts and folklore
Natural Computing | 2002-08-20 | Paper |
Binary (generalized) Post Correspondence Problem
Theoretical Computer Science | 2002-07-15 | Paper |
Marked PCP is decidable
Theoretical Computer Science | 2001-08-20 | Paper |
Generalized Post correspondence problem for marked morphisms
International Journal of Algebra and Computation | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1860689 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1390073 (Why is no real title available?) | 2000-10-03 | Paper |
Quantum computing
Natural Computing Series | 2000-06-18 | Paper |
| scientific article; zbMATH DE number 1304321 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1236366 (Why is no real title available?) | 1999-05-04 | Paper |
