| 2026 | CONCUR | Reachability in Fixed-Dimensional Continuous VASS. | Michal Ajdarw, A. R. Balasubramanian, Lukasz Orlikowski |
| 2026 | LICS | Hypersequent Calculi Have Ackermann Complexity. | A. R. Balasubramanian, Vitor Greati, Revantha Ramanayake |
| 2026 | LICS | The Complexity of Nested Reset Counter Systems. | A. R. Balasubramanian, Franzisco Schmidt |
| 2025 | KR | Presburger Functional Synthesis: Complexity and Tractable Normal Forms. | S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche |
| 2025 | LICS | Pushdown Model Checking above the Cubic Bottleneck. | A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar |
| 2024 | LICS | Decidability and Complexity of Decision Problems for Affine Continuous VASS. | A. R. Balasubramanian |
| 2022 | CONCUR | Complexity of Coverability in Depth-Bounded Processes. | A. R. Balasubramanian |
| 2022 | FOSSACS | Parameterized Analysis of Reconfigurable Broadcast Networks. | A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy |
| 2021 | CONCUR | Adaptive Synchronisation of Pushdown Automata. | A. R. Balasubramanian, K. S. Thejaswini |
| 2021 | FOSSACS | Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. | A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin |
| 2021 | LICS | Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. | A. R. Balasubramanian, Timo Lang, Revantha Ramanayake |
| 2020 | ATVA | Complexity of Verification and Synthesis of Threshold Automata. | A. R. Balasubramanian, Javier Esparza, Marijana Lazic |
| 2020 | CONCUR | Characterizing Consensus in the Heard-Of Model. | A. R. Balasubramanian, Igor Walukiewicz |
| 2020 | LICS | Complexity of controlled bad sequences over finite sets of Nd. | A. R. Balasubramanian |
| 2018 | TACAS | Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. | A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey |