| Roughness in Cayley graphs MH Shahzamanian, M Shirmohammadi, B Davvaz Information Sciences 180 (17), 3362-3372, 2010 | 49 | 2010 |
| Synchronizing words for weighted and timed automata L Doyen, L Juhl, KG Larsen, N Markey, M Shirmohammadi 34th International Conference on Foundation of Software Technology and …, 2014 | 26 | 2014 |
| On the complexity of value iteration N Balaji, S Kiefer, P Novotný, GA Pérez, M Shirmohammadi arXiv preprint arXiv:1807.04920, 2018 | 22 | 2018 |
| On restricted nonnegative matrix factorization D Chistikov, S Kiefer, I Marušić, M Shirmohammadi, J Worrell arXiv preprint arXiv:1605.07061, 2016 | 22 | 2016 |
| Infinite synchronizing words for probabilistic automata L Doyen, T Massart, M Shirmohammadi International Symposium on Mathematical Foundations of Computer Science, 278-289, 2011 | 21 | 2011 |
| Revisiting reachability in timed automata K Quaas, M Shirmohammadi, J Worrell 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 19 | 2017 |
| Nonnegative matrix factorization requires irrationality D Chistikov, S Kiefer, I Marusic, M Shirmohammadi, J Worrell SIAM Journal on Applied Algebra and Geometry 1 (1), 285-307, 2017 | 17 | 2017 |
| Parity objectives in countable MDPs S Kiefer, R Mayr, M Shirmohammadi, D Wojtczak arXiv preprint arXiv:1704.04490, 2017 | 16 | 2017 |
| Synchronizing automata over nested words D Chistikov, P Martyugin, M Shirmohammadi Foundations of Software Science and Computation Structures: 19th …, 2016 | 16 | 2016 |
| The complexity of synchronizing Markov decision processes L Doyen, T Massart, M Shirmohammadi Journal of Computer and System Sciences 100, 96-129, 2019 | 15 | 2019 |
| Strategy complexity of parity objectives in countable mdps S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:2007.05065, 2020 | 14 | 2020 |
| Trace refinement in labelled Markov decision processes N Fijalkow, S Kiefer, M Shirmohammadi Logical Methods in Computer Science 16, 2020 | 13 | 2020 |
| B\" uchi Objectives in Countable MDPs S Kiefer, R Mayr, M Shirmohammadi, P Totzke arXiv preprint arXiv:1904.11573, 2019 | 13 | 2019 |
| Limit synchronization in Markov decision processes L Doyen, T Massart, M Shirmohammadi International Conference on Foundations of Software Science and Computation …, 2014 | 12 | 2014 |
| Effective definability of the reachability relation in timed automata M Fränzle, K Quaas, M Shirmohammadi, J Worrell Information Processing Letters 153, 105871, 2020 | 11 | 2020 |
| Coverability in 1-vass with disequality tests S Almagor, N Cohen, GA Pérez, M Shirmohammadi, J Worrell arXiv preprint arXiv:1902.06576, 2019 | 11 | 2019 |
| Synchronizing data words for register automata P Babari, K Quaas, M Shirmohammadi 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 11 | 2016 |
| Robust synchronization in Markov decision processes L Doyen, T Massart, M Shirmohammadi International Conference on Concurrency Theory, 234-248, 2014 | 10 | 2014 |
| On the computation of the Zariski closure of finitely generated groups of matrices K Nosan, A Pouly, S Schmitz, M Shirmohammadi, J Worrell Proceedings of the 2022 International Symposium on Symbolic and Algebraic …, 2022 | 9 | 2022 |
| Synchronizing objectives for Markov decision processes L Doyen, T Massart, M Shirmohammadi arXiv preprint arXiv:1102.4121, 2011 | 9 | 2011 |
James WorrellProfessor of Computer Science, Oxford UniversityEmail verificata su cs.ox.ac.uk