default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahsa Shirmohammadi
Person information
- affiliation: CNRS, IRIF, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Alex Buna-Marginean
, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
On Learning Polynomial Recursive Programs. Proc. ACM Program. Lang. 8(POPL): 1001-1027 (2024)- [c27]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency 2024: 225-242 - [i34]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Memoryless Strategies in Stochastic Reachability Games. CoRR abs/2401.13390 (2024) - [i33]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR abs/2404.15483 (2024) - [i32]Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, James Worrell:
Determination Problems for Orbit Closures and Matrix Groups. CoRR abs/2407.04626 (2024) - [i31]Rida Ait El Manssour, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
On Tree Automata, Generating Functions, and Differential Equations. CoRR abs/2407.08218 (2024) - [i30]Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, Anton Varonka:
Simple Linear Loops: Algebraic Invariants and Applications. CoRR abs/2407.09154 (2024) - [i29]Andrew Scoones, Mahsa Shirmohammadi, James Worrell:
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates. CoRR abs/2407.18131 (2024) - [i28]Rida Ait El Manssour, Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
A parametric version of the Hilbert Nullstellensatz. CoRR abs/2408.13027 (2024) - 2023
- [c26]George Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. ISSAC 2023: 407-416 - [c25]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. LICS 2023: 1-12 - [i27]George Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. CoRR abs/2303.09204 (2023) - [i26]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. CoRR abs/2304.14145 (2023) - [i25]Alex Buna-Marginean, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
On Learning Polynomial Recursive Programs. CoRR abs/2310.14725 (2023) - 2022
- [j9]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and rewards in priced timed automata. Inf. Comput. 282: 104656 (2022) - [j8]Mahsa Shirmohammadi:
A Beginner's Tutorial on Strategy Complexity in Stochastic Games: Can the King Cautiously Eliminate Robin Hood? ACM SIGLOG News 9(4): 27-43 (2022) - [c24]Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. ISSAC 2022: 129-138 - [c23]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. ISSAC 2022: 381-389 - [c22]Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity Testing for Radical Expressions. LICS 2022: 8:1-8:11 - [i24]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. CoRR abs/2202.07416 (2022) - [i23]Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity testing for radical expressions. CoRR abs/2202.07961 (2022) - [i22]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR abs/2203.12024 (2022) - 2021
- [c21]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CONCUR 2021: 11:1-11:15 - [c20]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. ISSAC 2021: 35-42 - [e1]Catalin Dima, Mahsa Shirmohammadi:
Formal Modeling and Analysis of Timed Systems - 19th International Conference, FORMATS 2021, Paris, France, August 24-26, 2021, Proceedings. Lecture Notes in Computer Science 12860, Springer 2021, ISBN 978-3-030-85036-4 [contents] - [i21]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. CoRR abs/2106.01853 (2021) - 2020
- [j7]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective definability of the reachability relation in timed automata. Inf. Process. Lett. 153 (2020) - [j6]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. 16(2) (2020) - [c19]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - [c18]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR 2020: 39:1-39:17 - [c17]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak:
How to Play in Infinite MDPs (Invited Talk). ICALP 2020: 3:1-3:18 - [i20]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CoRR abs/2007.05065 (2020) - [i19]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. CoRR abs/2007.13179 (2020) - [i18]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CoRR abs/2012.13739 (2020)
2010 – 2019
- 2019
- [j5]Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. J. Autom. Lang. Comb. 24(2-4): 219-251 (2019) - [j4]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
The complexity of synchronizing Markov decision processes. J. Comput. Syst. Sci. 100: 96-129 (2019) - [j3]Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. ACM Trans. Comput. Log. 20(2): 11:1-11:27 (2019) - [c16]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Value Iteration. ICALP 2019: 102:1-102:15 - [c15]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. ICALP 2019: 119:1-119:14 - [i17]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CoRR abs/1902.06576 (2019) - [i16]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective Definability of the Reachability Relation in Timed Automata. CoRR abs/1903.09773 (2019) - [i15]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. CoRR abs/1904.11573 (2019) - [i14]Corto Mascle, Mahsa Shirmohammadi, Patrick Totzke:
Controlling a Random Population is EXPTIME-hard. CoRR abs/1909.06420 (2019) - 2018
- [c14]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and Rewards in Priced Timed Automata. ICALP 2018: 125:1-125:14 - [i13]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and Rewards in Priced Timed Automata. CoRR abs/1803.01914 (2018) - [i12]Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi:
On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. CoRR abs/1807.04920 (2018) - 2017
- [j2]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. 1(1): 285-307 (2017) - [c13]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity objectives in countable MDPs. LICS 2017: 1-11 - [c12]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On strong determinacy of countable stochastic games. LICS 2017: 1-12 - [c11]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting reachability in timed automata. LICS 2017: 1-12 - [c10]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Rationality of Nonnegative Matrix Factorization. SODA 2017: 1290-1305 - [i11]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting Reachability in Timed Automata. CoRR abs/1702.03450 (2017) - [i10]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity Objectives in Countable MDPs. CoRR abs/1704.04490 (2017) - [i9]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On Strong Determinacy of Countable Stochastic Games. CoRR abs/1704.05003 (2017) - [i8]Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. CoRR abs/1710.02329 (2017) - 2016
- [c9]Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. FoSSaCS 2016: 252-268 - [c8]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. FoSSaCS 2016: 303-318 - [c7]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. ICALP 2016: 103:1-103:14 - [c6]Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. MFCS 2016: 15:1-15:15 - [i7]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
The Complexity of Synchronizing Markov Decision Processes. CoRR abs/1604.01942 (2016) - [i6]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. CoRR abs/1605.06848 (2016) - [i5]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. CoRR abs/1605.07061 (2016) - 2015
- [i4]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. CoRR abs/1510.09102 (2015) - 2014
- [b1]Mahsa Shirmohammadi:
Qualitative analysis of synchronizing probabilistic systems. (Analyse qualitative des systèmes probabilistes synchronisants). École normale supérieure de Cachan, France, 2014 - [c5]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Robust Synchronization in Markov Decision Processes. CONCUR 2014: 234-248 - [c4]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Limit Synchronization in Markov Decision Processes. FoSSaCS 2014: 58-72 - [c3]Laurent Doyen, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey, Mahsa Shirmohammadi:
Synchronizing Words for Weighted and Timed Automata. FSTTCS 2014: 121-132 - [i3]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Robust Synchronization in Markov Decision Processes. CoRR abs/1402.2840 (2014) - 2013
- [i2]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Limit Synchronization in Markov Decision Processes. CoRR abs/1310.2935 (2013) - 2012
- [i1]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Infinite Synchronizing Words for Probabilistic Automata (Erratum). CoRR abs/1206.0995 (2012) - 2011
- [c2]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Infinite Synchronizing Words for Probabilistic Automata. MFCS 2011: 278-289 - [c1]Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Synchronizing Objectives for Markov Decision Processes. iWIGP 2011: 61-75 - 2010
- [j1]M. H. Shahzamanian, Mahsa Shirmohammadi, Bijan Davvaz:
Roughness in Cayley graphs. Inf. Sci. 180(17): 3362-3372 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
