Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. - A. R. Balasubramanian; Nathalie Bertrand 001; Nicolas Markey (TACAS (2), 2018)

Parameterized Verification of Coverability in Well-Structured Broadcast Networks. - A. R. Balasubramanian (GandALF, 2018)

Generalized threshold arrangements. - A. R. Balasubramanian (CoRR, 2019)

Complexity of controlled bad sequences over finite sets of Nk. - A. R. Balasubramanian (CoRR, 2019)

Complexity of Verification and Synthesis of Threshold Automata. - A. R. Balasubramanian; Javier Esparza; Marijana Lazic (ATVA, 2020)

Characterizing Consensus in the Heard-Of Model. - A. R. Balasubramanian; Igor Walukiewicz (CONCUR, 2020)

Parameterized Complexity of Safety of Threshold Automata. - A. R. Balasubramanian (FSTTCS, 2020)

Complexity of controlled bad sequences over finite sets of Nd. - A. R. Balasubramanian (LICS, 2020)

Adaptive Synchronisation of Pushdown Automata. - A. R. Balasubramanian; K. S. Thejaswini (CONCUR, 2021)

Complexity of Coverability in Bounded Path Broadcast Networks. - A. R. Balasubramanian (FSTTCS, 2021)

Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. - A. R. Balasubramanian; Timo Lang; Revantha Ramanayake (LICS, 2021)

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). - A. R. Balasubramanian; Chana Weil-Kennedy (CoRR, 2021)

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. - A. R. Balasubramanian; Chana Weil-Kennedy (GandALF, 2021)

Parameterized verification of coverability in infinite state broadcast networks. - A. R. Balasubramanian (Inf. Comput., 2021)

Complexity of Coverability in Depth-Bounded Processes. - A. R. Balasubramanian (CONCUR, 2022)

Parameterized Analysis of Reconfigurable Broadcast Networks. - A. R. Balasubramanian; Lucie Guillou; Chana Weil-Kennedy (FoSSaCS, 2022)

Coefficient Synthesis for Threshold Automata. - A. R. Balasubramanian (RP, 2022)

Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version). - A. R. Balasubramanian; Lucie Guillou; Chana Weil-Kennedy (CoRR, 2022)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. - A. R. Balasubramanian; Javier Esparza; Mikhail A. Raskin (Log. Methods Comput. Sci., 2023)

Decidability and Complexity of Decision Problems for Affine Continuous VASS. - A. R. Balasubramanian (LICS, 2024)

Reachability in Continuous Pushdown VASS. - A. R. Balasubramanian; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Proc. ACM Program. Lang., 2024)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms. - S. Akshay 001; A. R. Balasubramanian; Supratik Chakraborty; Georg Zetzsche (CoRR, 2025)