| Publication | Date of Publication | Type |
|---|
Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
SIAM Journal on Computing | 2024-12-12 | Paper |
On the identity and group problems for complex Heisenberg matrices
| 2024-10-23 | Paper |
The complexity of periodic energy minimisation
| 2024-08-06 | Paper |
Pushing lines helps: efficient universal centralised transformations for programmable matter
| 2024-04-05 | Paper |
The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
Information and Computation | 2024-01-18 | Paper |
The Maximum Cover with Rotating Field of View
| 2023-09-27 | Paper |
Integer Weighted Automata on Infinite Words
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
The k-centre problem for classes of cyclic words
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the Identity and Group Problems for Complex Heisenberg Matrices
| 2023-07-11 | Paper |
On the structural and combinatorial properties in 2-swap word permutation graphs
| 2023-07-04 | Paper |
Ranking Bracelets in Polynomial Time.
| 2023-06-14 | Paper |
Distributed transformations of Hamiltonian shapes based on line moves
Theoretical Computer Science | 2022-12-21 | Paper |
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Theoretical Computer Science | 2022-10-21 | Paper |
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
| 2022-07-21 | Paper |
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Distributed transformations of Hamiltonian shapes based on line moves
Algorithms for Sensor Systems | 2022-06-24 | Paper |
Optimizing reachability sets in temporal graphs by delaying
Information and Computation | 2022-06-08 | Paper |
Towards uniform online spherical tessellations
Discrete \& Computational Geometry | 2022-05-16 | Paper |
Integer weighted automata on infinite words
| 2022-03-25 | Paper |
On the hardness of energy minimisation for crystal structure prediction
Fundamenta Informaticae | 2022-03-09 | Paper |
On efficient connectivity-preserving transformations in a grid
Theoretical Computer Science | 2021-12-01 | Paper |
Reachability problems in low-dimensional nondeterministic polynomial maps over integers
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 |
Combinatorial Algorithms for Multidimensional Necklaces
| 2021-08-04 | Paper |
On the Identity Problem for the Special Linear Group and the Heisenberg Group.
| 2021-07-28 | Paper |
On efficient connectivity-preserving transformations in a grid
Lecture Notes in Computer Science | 2021-07-08 | Paper |
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
On the hardness of energy minimisation for crystal structure prediction
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
scientific article; zbMATH DE number 7204378 (Why is no real title available?)
| 2020-05-26 | Paper |
Pushing lines helps: efficient universal centralised transformations for programmable matter
Theoretical Computer Science | 2020-05-26 | Paper |
Towards uniform online spherical tessellations
Computing with Foresight and Industry | 2020-05-12 | Paper |
On decidability and complexity of low-dimensional robot games
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
Journal of Computer and System Sciences | 2019-05-02 | Paper |
Reachability problems in nondeterministic polynomial maps on the integers
| 2018-11-22 | Paper |
Vector Ambiguity and Freeness Problems in SL(2, ℤ)
Fundamenta Informaticae | 2018-10-02 | Paper |
Reachability problems for one-dimensional piecewise affine maps
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Decidability of the membership problem for \(2\times 2\) integer matrices
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | 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 |
Insertion-deletion systems over relational words
| 2018-03-26 | Paper |
Undecidability of two-dimensional robot games
| 2018-03-21 | Paper |
Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
| 2018-03-21 | Paper |
Weighted automata on infinite words in the context of attacker-defender games
Information and Computation | 2017-08-08 | Paper |
Composition problems for braids: Membership, Identity and Freeness
| 2017-07-26 | Paper |
Vector ambiguity and freeness problems in \(\mathrm{SL} (2,\mathbb {Z})\)
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Composition problems for braids
| 2017-02-21 | Paper |
On robot games of degree two
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Reachability problems for PAMs
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Geometric computations by broadcasting automata
Natural Computing | 2016-03-09 | Paper |
Weighted automata on infinite words in the context of attacker-defender games
Evolving Computability | 2015-10-20 | Paper |
Broadcasting automata and patterns on \(\mathbb{Z}^2\)
Automata, Universality, Computation | 2015-04-14 | 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 |
On algebra of languages representable by vertex-labeled graphs
Theoretical Computer Science | 2012-05-30 | Paper |
Geometric computations by broadcasting automata on the integer grid
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Planarity of Knots, Register Automata and LogSpace Computability
Language and Automata Theory and Applications | 2011-06-03 | 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 |
On decision problems for parameterized machines
Theoretical Computer Science | 2010-03-09 | Paper |
The Identity Correspondence Problem and Its Applications
Algorithms and Computation | 2009-12-17 | Paper |
On the Computational Power of Querying the History
Fundamenta Informaticae | 2009-06-23 | Paper |
Automata on Gauss Words
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Lowering Undecidability Bounds for Decision Questions in Matrices
Developments in Language Theory | 2009-03-26 | Paper |
Computation in One-Dimensional Piecewise Maps
Hybrid Systems: Computation and Control | 2009-03-11 | 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 LOW-DIMENSIONAL ITERATIVE MAPS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Reachability Problems in Quaternion Matrix and Rotation Semigroups
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | 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 |
Time efficient centralized gossiping in radio networks
Theoretical Computer Science | 2007-09-19 | Paper |
On a Maximal NFA Without Mergible States
Computer Science – Theory and Applications | 2007-05-02 | Paper |
On the membership of invertible diagonal and scalar matrices
Theoretical Computer Science | 2007-03-15 | Paper |
Deterministic communication in radio networks with large labels
Algorithmica | 2007-03-05 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Unconventional Computation
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Space efficient search for maximal repetitions
Theoretical Computer Science | 2005-06-30 | Paper |
scientific article; zbMATH DE number 2051171 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 1998342 (Why is no real title available?)
| 2003-10-29 | Paper |
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
The Computer Journal | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1948455 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1947418 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1849117 (Why is no real title available?)
| 2003-01-06 | Paper |
scientific article; zbMATH DE number 1839439 (Why is no real title available?)
| 2002-12-02 | Paper |
