Publications
A full publication list is available at dblp.
Conference publications
A. R. Balasubramanian, R. Majumdar, R. S. Thinniyam, G. Zetzsche. Reachability in Continuous Pushdown VASS. POPL, 2024. [paper]
A. R. Balasubramanian. Coefficient Synthesis for Threshold Automata. RP, 2022. [paper]
A. R. Balasubramanian. Complexity of Coverability in Depth-Bounded Processes. CONCUR, 2022. [paper]
A. R. Balasubramanian, L. Guillou, C. Weil-Kennedy. Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS, 2022. [paper] [erratum]
A. R. Balasubramanian. Complexity of Coverability in Bounded Path Broadcast Networks. FSTTCS, 2021. [paper]
A. R. Balasubramanian, C. Weil-Kennedy. Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF, 2021. [paper]
A. R. Balasubramanian, K. S. Thejaswini. Adaptive Synchronisation of Pushdown Automata. CONCUR, 2021. [paper]
A. R. Balasubramanian, T. Lang, R. Ramanayake. Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. LICS, 2021. [paper]
A. R. Balasubramanian, J. Esparza and M. Raskin. Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS, 2021. Invited for LMCS special issue. [paper, arXiv]
A. R. Balasubramanian. Parameterized Complexity of Safety of Threshold Automata. FSTTCS, 2020. [paper, conference talk]
A. R. Balasubramanian, J. Esparza, and M. Lazić. Complexity of Verification and Synthesis of Threshold Automata. ATVA, 2020 [paper, arXiv]
A. R. Balasubramanian, I. Walukiewicz. Characterizing consensus in the Heard-Of model. CONCUR, 2020. [paper, arXiv]
A. R. Balasubramanian. Complexity of controlled bad sequences over finite sets of Nd. LICS, 2020. [paper, conference talk, poster]
A. R. Balasubramanian. Parameterized Verification of Coverability in Well-Structured Broadcast Networks. GandALF, 2018. Invited for Information and Computation special issue. [paper]
A. R. Balasubramanian, N. Bertrand, and N. Markey. Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. TACAS, 2018 [paper, arXiv]
Journal publications
A. R. Balasubramanian, J. Esparza and M. Raskin. Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. In LMCS 2023. Special issue on FoSSaCS 2021. [paper]
A. R. Balasubramanian. Parameterized Verification of Coverability in Infinite State Broadcast Networks. In Information and Computation: 2020. Special issue on GandALF 2018. [paper]
Invited Talks
- Complexity of Verification and Synthesis of Threshold Automata at FRIDA 2020. Talk