| Limited set quantifiers over countable linear orderings T Colcombet, AV Sreejith International Colloquium on Automata, Languages, and Programming, 146-158, 2015 | 9 | 2015 |
| Two-variable logic over countable linear orderings A Manuel, AV Sreejith 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 8 | 2016 |
| Non-definability of languages by generalized first-order formulas over (N,+) A Krebs, AV Sreejith 2012 27th Annual IEEE Symposium on Logic in Computer Science, 451-460, 2012 | 7 | 2012 |
| LTL can be more succinct K Lodaya, AV Sreejith International Symposium on Automated Technology for Verification and …, 2010 | 7 | 2010 |
| Regular quantifiers in logics AV Sreejith Ph. D. thesis, HBNI, 2013 | 5 | 2013 |
| Undecidability of mso+" ultimately periodic M Bojańczyk, L Daviaud, B Guillon, V Penelle, AV Sreejith Logical Methods in Computer Science abs/1807.08506 ((to appear)), 2018 | 4 | 2018 |
| Weighted One-Deterministic-Counter Automata P Mathew, V Penelle, P Saivasan, AV Sreejith arXiv preprint arXiv:2301.13456, 2023 | 3 | 2023 |
| Expressive completeness for LTL with modulo counting and group quantifiers AV Sreejith Electronic Notes in Theoretical Computer Science 278, 201-214, 2011 | 3 | 2011 |
| First-order logic and its infinitary quantifier extensions over countable words B Adsul, S Sarkar, AV Sreejith Fundamentals of Computation Theory: 23rd International Symposium, FCT 2021 …, 2021 | 2 | 2021 |
| Block products for algebras over countable words and applications to logic B Adsul, S Sarkar, AV Sreejith 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019 | 2 | 2019 |
| Two-variable first order logic with counting quantifiers: Complexity results K Lodaya, AV Sreejith International Conference on Developments in Language Theory, 260-271, 2017 | 2 | 2017 |
| On lower bounds for multiplicative circuits and linear circuits in noncommutative domains V Arvind, S Raja, AV Sreejith Computer Science-Theory and Applications: 9th International Computer Science …, 2014 | 2 | 2014 |
| Undecidability of a weak version of MSO+ U M Bojańczyk, L Daviaud, B Guillon, V Penelle, AV Sreejith Logical Methods in Computer Science 16, 2020 | 1 | 2020 |
| Learning real-time one-counter automata using polynomially many queries P Mathew, V Penelle, AV Sreejith arXiv preprint arXiv:2411.08815, 2024 | | 2024 |
| Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words B Adsul, S Sarkar, AV Sreejith Journal of Computer and System Sciences 136, 302-326, 2023 | | 2023 |
| Logic and Its Applications: 10th Indian Conference, ICLA 2023, Indore, India, March 3–5, 2023, Proceedings M Banerjee, AV Sreejith Springer Nature, 2023 | | 2023 |
| One Deterministic-Counter Automata. P Mathew, V Penelle, P Saivasan, AV Sreejith arXiv preprint arXiv:2301.13456, 2023 | | 2023 |
| Implementation aspects of SIR, SAIR models and of Levitt measure on COVID-19 in India VK Rai, AV Sreejith, S Biswas Indian Institute of Technology Goa, 2021 | | 2021 |
| Data Driven Predictive Modeling of Infectious Disease Spread using the SIR Model S Biswas, AV Sreejith, IIT Goa | | 2020 |
| Undecidability of a weak version of MSO+ U L Daviaud, B Guillon, V Penelle, AV Sreejith Technischen Universitat Braunschweig, 2020 | | 2020 |
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaE-mail confirmado em imsc.res.in