| 2025 | LICS | Learning Deterministic One-Counter Automata in Polynomial Time. | Prince Mathew, Vincent Penelle, A. V. Sreejith |
| 2025 | TACAS | Learning Real-Time One-Counter Automata Using Polynomially Many Queries. | Prince Mathew, Vincent Penelle, A. V. Sreejith |
| 2021 | FCT | First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. | Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith |
| 2019 | LICS | Block products for algebras over countable words and applications to logic. | Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith |
| 2017 | DLT | Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. | Kamal Lodaya, A. V. Sreejith |
| 2016 | MFCS | Two-Variable Logic over Countable Linear Orderings. | Amaldev Manuel, A. V. Sreejith |
| 2015 | ICALP | Limited Set quantifiers over Countable Linear Orderings. | Thomas Colcombet, A. V. Sreejith |
| 2014 | CSR | On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. | Vikraman Arvind, S. Raja, A. V. Sreejith |
| 2012 | LICS | Non-definability of Languages by Generalized First-order Formulas over (N, +). | Andreas Krebs, A. V. Sreejith |
| 2010 | ATVA | LTL Can Be More Succinct. | Kamal Lodaya, A. V. Sreejith |