A. R. Balasubramanian

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 32

Top Topics

Decision Problems

Parameterized Complexity

Top Venues

Publications

A. R. Balasubramanian
Decidability and Complexity of Decision Problems for Affine Continuous VASS. CoRR (2024)
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8 (POPL) (2024)
A. R. Balasubramanian
Decidability and Complexity of Decision Problems for Affine Continuous VASS. LICS (2024)
A. R. Balasubramanian
Parameterized Verification of Coverability in Infinite State Broadcast Networks. CoRR (2023)
A. R. Balasubramanian
Coefficient Synthesis for Threshold Automata. CoRR (2023)
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. CoRR (2023)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. Log. Methods Comput. Sci. 19 (4) (2023)
A. R. Balasubramanian
Coefficient Synthesis for Threshold Automata. RP (2022)
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version). CoRR (2022)
A. R. Balasubramanian
Complexity of Coverability in Depth-Bounded Processes. CONCUR (2022)
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS (2022)
A. R. Balasubramanian, K. S. Thejaswini
Adaptive Synchronisation of Pushdown Automata. CONCUR (2021)
A. R. Balasubramanian
Complexity of Coverability in Bounded Path Broadcast Networks. FSTTCS (2021)
A. R. Balasubramanian, Chana Weil-Kennedy
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). CoRR (2021)
A. R. Balasubramanian
Parameterized verification of coverability in infinite state broadcast networks. Inf. Comput. 278 (2021)
A. R. Balasubramanian, K. S. Thejaswini
Adaptive Synchronisation of Pushdown Automata. CoRR (2021)
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. CoRR (2021)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. FoSSaCS (2021)
A. R. Balasubramanian, Chana Weil-Kennedy
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF (2021)
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. LICS (2021)
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Complexity of Verification and Synthesis of Threshold Automata. CoRR (2020)
A. R. Balasubramanian, Igor Walukiewicz
Characterizing consensus in the Heard-Of model. CoRR (2020)
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
Complexity of Verification and Synthesis of Threshold Automata. ATVA (2020)
A. R. Balasubramanian, Igor Walukiewicz
Characterizing Consensus in the Heard-Of Model. CONCUR (2020)
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. CoRR (2020)
A. R. Balasubramanian
Complexity of controlled bad sequences over finite sets of Nd. LICS (2020)
A. R. Balasubramanian
Parameterized Complexity of Safety of Threshold Automata. FSTTCS (2020)
A. R. Balasubramanian
Generalized threshold arrangements. CoRR (2019)
A. R. Balasubramanian
. CoRR (2019)
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
Parameterized verification of synchronization in constrained reconfigurable broadcast networks. CoRR (2018)
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. TACAS (2) (2018)
A. R. Balasubramanian
Parameterized Verification of Coverability in Well-Structured Broadcast Networks. GandALF (2018)