Mahsa Shirmohammadi
University of Oxford
H-index: 12
Europe-United Kingdom
Top articles of Mahsa Shirmohammadi
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Memoryless Strategies in Stochastic Reachability Games | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke | 2024/3/20 | |
On Learning Polynomial Recursive Programs | Proceedings of the ACM on Programming Languages | Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell | 2024/1/5 |
A Beginner's Tutorial on Strategy Complexity in Stochastic Games: Can the King Cautiously Eliminate Robin Hood? | ACM SIGLOG News | Mahsa Shirmohammadi | 2023/2/6 |
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters | George Kenison Klara Nosan Mahsa Shirmohammadi James Worrell | 2023/7/24 | |
Multiplicity Problems on Algebraic Series and Context-Free Grammars | Nikhil Balaji Lorenzo Clemente Klara Nosan Mahsa Shirmohammadi James Worrell | 2023/6/26 | |
Identity testing for radical expressions | Nikhil Balaji Klara Nosan Mahsa Shirmohammadi James Worrell | 2022/8/2 | |
On the computation of the Zariski closure of finitely generated groups of matrices | Klara Nosan Amaury Pouly Sylvain Schmitz Mahsa Shirmohammadi James Worrell | 2022/7/4 | |
Strategy complexity of reachability in countable stochastic 2-player games | arXiv preprint arXiv:2203.12024 | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke | 2022/3/22 |
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. | arXiv preprint arXiv:2106.01853 | Klara Nosan Amaury Pouly Mahsa Shirmohammadi James Worrell | 2021/6 |
Formal Modeling and Analysis of Timed Systems | Alessandro Abate Gilles Geeraerts | 2017 | |
Cyclotomic identity testing and applications | Nikhil Balaji Sylvain Perifel Mahsa Shirmohammadi James Worrell | 2021/7/18 | |
How to play in infinite MDPs (invited talk) | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke Dominik Wojtczak | 2020/6/29 | |
Trace refinement in labelled Markov decision processes | Logical Methods in Computer Science | Nathanaël Fijalkow Stefan Kiefer Mahsa Shirmohammadi | 2020/6/3 |
Effective definability of the reachability relation in timed automata | Information Processing Letters | Martin Fränzle Karin Quaas Mahsa Shirmohammadi James Worrell | 2020/1/1 |
Transience in countable MDPs | arXiv preprint arXiv:2012.13739 | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke | 2020/12/26 |
How to Play in Infinite MDPs | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke Dominik Wojtczak | 2020/7/8 | |
Strategy complexity of parity objectives in countable mdps | arXiv preprint arXiv:2007.05065 | Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke | 2020/7/7 |
Co-Authors
