Author of the publication

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

, , , , and . ISSAC, page 129-138. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Length of Strongly Monotone Descending Chains over Nd., and . CoRR, (2023)The ideal view on Rackoff's coverability technique., and . Inf. Comput., (2021)On the Length of Strongly Monotone Descending Chains over ℕ^d., and . ICALP, volume 297 of LIPIcs, page 153:1-153:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension., and . LICS, page 1-13. IEEE, (2019)The Complexity of Coverability in ν-Petri Nets., and . LICS, page 467-476. ACM, (2016)The Parametric Complexity of Lossy Counter Machines.. ICALP, volume 132 of LIPIcs, page 129:1-129:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Decidable XPath Fragments in the Real World., , and . PODS, page 285-302. ACM, (2019)Calculs d'unification sur les arbres de dérivation TAG., and . TALN (Articles courts), page 11-20. ATALA, (2008)A Hypersequent Calculus with Clusters for Linear Frames., , and . Advances in Modal Logic, page 43-62. College Publications, (2018)Preface., , , and . Fundam. Informaticae, (2022)