Roughness in Cayley graphs. - M. H. Shahzamanian; Mahsa Shirmohammadi; Bijan Davvaz (Inf. Sci., 2010)

Infinite Synchronizing Words for Probabilistic Automata. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (MFCS, 2011)

Synchronizing Objectives for Markov Decision Processes - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (iWIGP, 2011)

Infinite Synchronizing Words for Probabilistic Automata (Erratum) - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (CoRR, 2012)

Robust Synchronization in Markov Decision Processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (CONCUR, 2014)

Limit Synchronization in Markov Decision Processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (FoSSaCS, 2014)

Synchronizing Words for Weighted and Timed Automata. - Laurent Doyen 001; Line Juhl; Kim Guldstrand Larsen; Nicolas Markey; Mahsa Shirmohammadi (FSTTCS, 2014)

Qualitative analysis of synchronizing probabilistic systems. (Analyse qualitative des systèmes probabilistes synchronisants). - Mahsa Shirmohammadi (2014)

On Restricted Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (ICALP, 2016)

Synchronizing Data Words for Register Automata. - Parvaneh Babari; Karin Quaas; Mahsa Shirmohammadi (MFCS, 2016)

Parity objectives in countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Dominik Wojtczak (LICS, 2017)

On strong determinacy of countable stochastic games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Dominik Wojtczak (LICS, 2017)

Revisiting reachability in timed automata. - Karin Quaas; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2017)

On Rationality of Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SODA, 2017)

Nonnegative Matrix Factorization Requires Irrationality. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SIAM J. Appl. Algebra Geom., 2017)

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (CoRR, 2018)

On the Complexity of Value Iteration. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (ICALP, 2019)

Büchi Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (ICALP, 2019)

Controlling a Random Population is EXPTIME-hard. - Corto Mascle; Mahsa Shirmohammadi; Patrick Totzke (CoRR, 2019)

Synchronizing Automata over Nested Words. - Dmitry Chistikov 001; Pavel Martyugin; Mahsa Shirmohammadi (J. Autom. Lang. Comb., 2019)

The complexity of synchronizing Markov decision processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (J. Comput. Syst. Sci., 2019)

Synchronizing Data Words for Register Automata. - Karin Quaas; Mahsa Shirmohammadi (ACM Trans. Comput. Log., 2019)

Coverability in 1-VASS with Disequality Tests. - Shaull Almagor; Nathann Cohen; Guillermo A. Pérez 001; Mahsa Shirmohammadi; James Worrell 001 (CONCUR, 2020)

Strategy Complexity of Parity Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2020)

How to Play in Infinite MDPs (Invited Talk). - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke; Dominik Wojtczak (ICALP, 2020)

Effective definability of the reachability relation in timed automata. - Martin Fränzle; Karin Quaas; Mahsa Shirmohammadi; James Worrell 001 (Inf. Process. Lett., 2020)

Trace Refinement in Labelled Markov Decision Processes. - Nathanaël Fijalkow; Stefan Kiefer; Mahsa Shirmohammadi (Log. Methods Comput. Sci., 2020)

Transience in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2021)

Cyclotomic Identity Testing and Applications. - Nikhil Balaji; Sylvain Perifel; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2021)

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. - Klara Nosan; Amaury Pouly; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2021)

The Membership Problem for Hypergeometric Sequences with Rational Parameters. - Klara Nosan; Amaury Pouly; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2022)

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. - Klara Nosan; Amaury Pouly; Sylvain Schmitz; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2022)

Identity Testing for Radical Expressions. - Nikhil Balaji; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2022)

Costs and rewards in priced timed automata. - Martin Fränzle; Mahsa Shirmohammadi; Mani Swaminathan; James Worrell 001 (Inf. Comput., 2022)

A Beginner's Tutorial on Strategy Complexity in Stochastic Games: Can the King Cautiously Eliminate Robin Hood? - Mahsa Shirmohammadi (ACM SIGLOG News, 2022)

The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. - George Kenison; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2023)

Multiplicity Problems on Algebraic Series and Context-Free Grammars. - Nikhil Balaji; Lorenzo Clemente; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2023)

Memoryless Strategies in Stochastic Reachability Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Taming the Infinities of Concurrency, 2024)

Strategy Complexity of B "uchi Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CoRR, 2024)

Determination Problems for Orbit Closures and Matrix Groups. - Rida Ait El Manssour; George Kenison; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2024)

On Tree Automata, Generating Functions, and Differential Equations. - Rida Ait El Manssour; Vincent Cheval; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2024)

On Learning Polynomial Recursive Programs. - Alex Buna-Marginean; Vincent Cheval; Mahsa Shirmohammadi; James Worrell 001 (Proc. ACM Program. Lang., 2024)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates. - Andrew Scoones; Mahsa Shirmohammadi; James Worrell 001 (CSL, 2025)

Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (EC, 2025)

A parametric version of the Hilbert Nullstellensatz. - Rida Ait El Manssour; Nikhil Balaji; Klara Nosan; Mahsa Shirmohammadi; James Worrell 001 (SOSA, 2025)

Simple Linear Loops: Algebraic Invariants and Applications. - Rida Ait El Manssour; George Kenison; Mahsa Shirmohammadi; Anton Varonka (Proc. ACM Program. Lang., 2025)

Learning Weighted Automata over Number Rings, Concretely and Categorically. - Quentin Aristote; Sam van Gool; Daniela Petrisan; Mahsa Shirmohammadi (CoRR, 2025)

Algebraic Closure of Matrix Sets Recognized by 1-VASS. - Rida Ait El Manssour; Mahsa Naraghi; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2025)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games. - Vincent Cheval; Florian Horn; Soumyajit Paul; Mahsa Shirmohammadi (CoRR, 2025)

On the growth of hypergeometric sequences. - George Kenison; Jakub Konieczny; Florian Luca; Andrew Scoones; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2025)

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Dyn. Games Appl., 2025)