| Publication | Date of Publication | Type |
|---|
| On the identity and group problems for complex Heisenberg matrices | 2024-10-23 | Paper |
The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
Information and Computation | 2024-01-18 | Paper |
Decision questions for probabilistic automata on small alphabets
Logical Methods in Computer Science | 2024-01-16 | Paper |
| Decision questions for probabilistic automata on small alphabets | 2023-08-08 | Paper |
| On the Identity and Group Problems for Complex Heisenberg Matrices | 2023-07-11 | Paper |
| Polynomially Ambiguous Probabilistic Automata on Restricted Languages | 2022-07-21 | Paper |
| Acceptance Ambiguity for Quantum Automata | 2022-07-21 | Paper |
| On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond | 2022-07-21 | Paper |
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
(available as arXiv preprint) | 2022-07-18 | Paper |
Towards uniform online spherical tessellations
Discrete & Computational Geometry | 2022-05-16 | Paper |
Polynomially ambiguous probabilistic automata on restricted languages
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Polynomially ambiguous probabilistic automata on restricted languages
Journal of Computer and System Sciences | 2022-04-04 | Paper |
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Information and Computation | 2021-11-25 | Paper |
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
Information and Computation | 2021-11-25 | Paper |
On injectivity of quantum finite automata
Journal of Computer and System Sciences | 2021-09-17 | Paper |
Towards uniform online spherical tessellations
Computing with Foresight and Industry | 2020-05-12 | Paper |
Unique decipherability in formal languages
Theoretical Computer Science | 2019-12-27 | Paper |
Freeness properties of weighted and probabilistic automata over bounded languages
Information and Computation | 2019-12-18 | 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 decidability and complexity of problems for restricted hierarchical hybrid systems
Theoretical Computer Science | 2016-11-04 | Paper |
Scalar ambiguity and freeness in matrix semigroups over bounded languages
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Factorization in formal languages
Developments in Language Theory | 2015-11-10 | Paper |
Factorization in formal languages
Developments in Language Theory | 2015-11-10 | Paper |
Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
Lecture Notes in Computer Science | 2015-10-28 | Paper |
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Reachability problems for hierarchical piecewise constant derivative systems
Lecture Notes in Computer Science | 2014-07-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 |
On the computational complexity of matrix semigroup problems
Fundamenta Informaticae | 2012-06-20 | Paper |
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
The continuous Skolem-Pisot problem
Theoretical Computer Science | 2010-10-11 | Paper |
On the joint spectral radius for bounded matrix languages
Lecture Notes in Computer Science | 2010-08-31 | Paper |
The Identity Correspondence Problem and Its Applications
Algorithms and Computation | 2009-12-17 | Paper |
Lowering Undecidability Bounds for Decision Questions in Matrices
Developments in Language Theory | 2009-03-26 | Paper |
MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
International Journal of Algebra and Computation | 2009-02-10 | Paper |
Reachability problems in quaternion matrix and rotation semigroups
Information and Computation | 2008-12-03 | Paper |
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
| The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations | 2008-09-12 | Paper |
Periodic and Infinite Traces in Matrix Semigroups
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
On undecidability bounds for matrix decision problems
Theoretical Computer Science | 2008-03-05 | Paper |
| A note on the emptiness of semigroup intersections | 2007-10-17 | Paper |
On the membership of invertible diagonal and scalar matrices
Theoretical Computer Science | 2007-03-15 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
