( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

, , , , и . ISSAC, стр. 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.

Mahsa Shirmohammadi

Dirk Mahsarski

Mahsa Najafzadeh

Mahsa Behzadi

Mahsa Vafaie KIT

 

Другие публикации лиц с тем же именем

Coverability in 1-VASS with Disequality Tests., , , , и . CONCUR, том 171 из LIPIcs, стр. 38:1-38:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices., , , , и . ISSAC, стр. 129-138. ACM, (2022)Effective Definability of the Reachability Relation in Timed Automata., , , и . CoRR, (2019)Memoryless Strategies in Stochastic Reachability Games., , , и . Taming the Infinities of Concurrency, том 14660 из Lecture Notes in Computer Science, стр. 225-242. Springer, (2024)On Learning Polynomial Recursive Programs., , , и . CoRR, (2023)On the Complexity of Value Iteration., , , , и . ICALP, том 132 из LIPIcs, стр. 102:1-102:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)How to Play in Infinite MDPs (Invited Talk)., , , , и . ICALP, том 168 из LIPIcs, стр. 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Transience in Countable MDPs., , , и . CoRR, (2020)Büchi Objectives in Countable MDPs., , , и . ICALP, том 132 из LIPIcs, стр. 119:1-119:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices., , , и . CoRR, (2021)