A. R. Balasubramanian

39 papers A* 5B 6Journal 22Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
General Decidability Results for Systems with Continuous Counters.
Proc. ACM Program. Lang.
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2026 J jnl
Hypersequent Calculi Have Ackermannian Complexity.
CoRR
A. R. Balasubramanian, Vitor Greati, Revantha Ramanayake
2025 J jnl
General Decidability Results for Systems with Continuous Counters.
CoRR
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2025 A* conf
Presburger Functional Synthesis: Complexity and Tractable Normal Forms.
KR
S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche
2025 J jnl
Presburger Functional Synthesis: Complexity and Tractable Normal Forms.
CoRR
S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche
2025 A* conf
Pushdown Model Checking above the Cubic Bottleneck.
LICS
A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar
2025 J jnl
State Space Estimation for DPOR-based Model Checkers.
CoRR
A. R. Balasubramanian, Mohammad Hossein Khoshechin Jorshari, Rupak Majumdar, Umang Mathur, Minjian Zhang
2024 A* conf
Decidability and Complexity of Decision Problems for Affine Continuous VASS.
LICS
A. R. Balasubramanian
2024 J jnl
Decidability and Complexity of Decision Problems for Affine Continuous VASS.
CoRR
A. R. Balasubramanian
2024 J jnl
Reachability in Continuous Pushdown VASS.
Proc. ACM Program. Lang.
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2023 J jnl
Coefficient Synthesis for Threshold Automata.
CoRR
A. R. Balasubramanian
2023 J jnl
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
Log. Methods Comput. Sci.
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2023 J jnl
Parameterized Verification of Coverability in Infinite State Broadcast Networks.
CoRR
A. R. Balasubramanian
2023 J jnl
Reachability in Continuous Pushdown VASS.
CoRR
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
2022 — conf
Coefficient Synthesis for Threshold Automata.
RP
A. R. Balasubramanian
2022 B conf
Complexity of Coverability in Depth-Bounded Processes.
CONCUR
A. R. Balasubramanian
2022 J jnl
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version).
CoRR
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
2022 B conf
Parameterized Analysis of Reconfigurable Broadcast Networks.
FoSSaCS
A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy
2021 B conf
Adaptive Synchronisation of Pushdown Automata.
CONCUR
A. R. Balasubramanian, K. S. Thejaswini
2021 J jnl
Adaptive Synchronisation of Pushdown Automata.
CoRR
A. R. Balasubramanian, K. S. Thejaswini
2021 — conf
Complexity of Coverability in Bounded Path Broadcast Networks.
FSTTCS
A. R. Balasubramanian
2021 A* conf
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics.
LICS
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
2021 J jnl
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics.
CoRR
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
2021 B conf
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
FoSSaCS
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2021 J jnl
Parameterized verification of coverability in infinite state broadcast networks.
Inf. Comput.
A. R. Balasubramanian
2021 J jnl
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version).
CoRR
A. R. Balasubramanian, Chana Weil-Kennedy
2021 — conf
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent.
GandALF
A. R. Balasubramanian, Chana Weil-Kennedy
2020 B conf
Characterizing Consensus in the Heard-Of Model.
CONCUR
A. R. Balasubramanian, Igor Walukiewicz
2020 J jnl
Characterizing consensus in the Heard-Of model.
CoRR
A. R. Balasubramanian, Igor Walukiewicz
2020 B conf
Complexity of Verification and Synthesis of Threshold Automata.
ATVA
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
2020 J jnl
Complexity of Verification and Synthesis of Threshold Automata.
CoRR
A. R. Balasubramanian, Javier Esparza, Marijana Lazic
2020 A* conf
Complexity of controlled bad sequences over finite sets of Nd.
LICS
A. R. Balasubramanian
2020 J jnl
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.
CoRR
A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin
2020 — conf
Parameterized Complexity of Safety of Threshold Automata.
FSTTCS
A. R. Balasubramanian
2019 J jnl
Complexity of controlled bad sequences over finite sets of N
CoRR
A. R. Balasubramanian
2019 J jnl
Generalized threshold arrangements.
CoRR
A. R. Balasubramanian
2018 — conf
Parameterized Verification of Coverability in Well-Structured Broadcast Networks.
GandALF
A. R. Balasubramanian
2018 — conf
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks.
TACAS (2)
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
2018 J jnl
Parameterized verification of synchronization in constrained reconfigurable broadcast networks.
CoRR
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey