Publications

A full publication list is available at dblp.

Conference Publications

2026

• Reachability in Fixed-Dimensional Continuous VASS [paper] [arXiv]
  M. Ajdarów, A. R. Balasubramanian, Ł. Orlikowski
  International Conference on Concurrency Theory (CONCUR) 2026
  Best Paper Award

• The Complexity of Nested Reset Counter Systems [paper] [arXiv]
  A. R. Balasubramanian, F. Schmidt
  Logic in Computer Science (LICS) 2026

• Hypersequent Calculi Have Ackermann Complexity [paper] [arXiv]
  A. R. Balasubramanian, V. Greati, R. Ramanayake
  Logic in Computer Science (LICS) 2026

• State Space Estimation for DPOR-based Model Checkers [paper] [arXiv]
  A. R. Balasubramanian, M. H. K. Jorshari, R. Majumdar, U. Mathur, M. Zhang
  Programming Language Design and Implementation (PLDI 2026)

• General Decidability Results for Systems with Continuous Counters [paper] [arXiv]
  A. R. Balasubramanian, M. Hague, R. Majumdar, R. S. Thinniyam and G. Zetzsche
  Principles of Programming Languages (POPL) 2026

2025

• Presburger Functional Synthesis: Complexity and Tractable Normal Forms [paper] [arXiv]
  S. Akshay, A. R. Balasubramanian, S. Chakraborty and G. Zetzsche
  International Conference on the Principles of Knowledge Representation and Reasoning (KR) 2025

• Pushdown Model Checking above the Cubic Bottleneck [paper]
  A. R. Balasubramanian, D. Chistikov and R. Majumdar
  Logic in Computer Science (LICS) 2025
  Distinguished Paper Award, Invited to TheoretiCS special issue

2024

• Decidability and Complexity of Decision Problems for Affine Continuous VASS [paper] [arXiv]
  A. R. Balasubramanian
  Logic in Computer Science (LICS) 2024

• Reachability in Continuous Pushdown VASS [paper] [arXiv]
  A. R. Balasubramanian, R. Majumdar, R. S. Thinniyam, G. Zetzsche
  Principles of Programming Languages (POPL) 2024

2022

• Coefficient Synthesis for Threshold Automata [paper] [arXiv]
  A. R. Balasubramanian
  Reachability Problems (RP) 2022
  Invited to Fundamenta Informaticae special issue

• Complexity of Coverability in Depth-Bounded Processes [paper]
  A. R. Balasubramanian
  International Conference on Concurrency Theory (CONCUR) 2022

• Parameterized Analysis of Reconfigurable Broadcast Networks [paper] [arXiv] [erratum]
  A. R. Balasubramanian, L. Guillou, C. Weil-Kennedy
  International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) 2022

2021

• Complexity of Coverability in Bounded Path Broadcast Networks [paper]
  A. R. Balasubramanian
  Foundations of Software Technology & Theoretical Computer Science (FSTTCS) 2021

• Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent [paper] [arXiv]
  A. R. Balasubramanian, C. Weil-Kennedy
  Symposium on Games, Automata, Logics and Formal Verification (GandALF): 2021

• Adaptive Synchronisation of Pushdown Automata [paper] [arXiv]
  A. R. Balasubramanian, K. S. Thejaswini
  International Conference on Concurrency Theory (CONCUR) 2021

• Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics [paper] [arXiv]
  A. R. Balasubramanian, T. Lang, R. Ramanayake
  Logic in Computer Science (LICS) 2021

• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy [paper] [arXiv]
  A. R. Balasubramanian, J. Esparza and M. Raskin
  International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) 2021
  Invited to LMCS special issue

2020

• Parameterized Complexity of Safety of Threshold Automata [paper] [code]
  A. R. Balasubramanian
  Foundations of Software Technology & Theoretical Computer Science (FSTTCS) 2020

• Complexity of Verification and Synthesis of Threshold Automata [paper] [arXiv] [code]
  A. R. Balasubramanian, J. Esparza, and M. Lazić
  International Symposium on Automated Technology for Verification and Analysis (ATVA) 2020

• Characterizing consensus in the Heard-Of model [paper] [arXiv]
  A. R. Balasubramanian, I. Walukiewicz
  International Conference on Concurrency Theory (CONCUR) 2020

• Complexity of controlled bad sequences over finite sets of Nd [paper] [arXiv]
  A. R. Balasubramanian
  Logic in Computer Science (LICS) 2020

2018

• Parameterized Verification of Coverability in Well-Structured Broadcast Networks [paper]
  A. R. Balasubramanian
  Symposium on Games, Automata, Logics and Formal Verification (GandALF): 2018
  Invited to Information and Computation special issue

• Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks [paper] [arXiv]
  A. R. Balasubramanian, N. Bertrand, and N. Markey
  Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 2018

Journal Publications

• Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy [paper]
  A. R. Balasubramanian, J. Esparza and M. Raskin
  Logical Methods in Computer Science 2023
  Special issue of FoSSaCS 2021

• Parameterized Verification of Coverability in Infinite State Broadcast Networks [paper]
  A. R. Balasubramanian
  Information and Computation 2020
  Special issue of GandALF 2018

Preprints and Submissions

• The Complexity of Coverability in Affine VASS and Affine Continuous VASS
  A. R. Balasubramanian, M. Raskin and T. Rubab
  Submitted to ICALP 2027

• Beep Is All You Need
  A. R. Balasubramanian, L. Guillou
  Submitted to ICALP 2027

• Context-Bounded Plans for Hierarchical Task Networks
  A. R. Balasubramanian
  Submitted to AAAI 2027

• Pushdown Model Checking Above the Cubic Bottleneck [arXiv]
  A. R. Balasubramanian, D. Chistikov, R. Majumdar
  Submitted to TheoretiCS
  Special issue of LICS 2025

• Coefficient Synthesis for Threshold Automata [arXiv]
  A. R. Balasubramanian
  Submitted to Fundamenta Informaticae
  Special issue of RP 2022 and 2023