News

Sep 2026 Our paper Reachability in Fixed-Dimensional Continuous VASS (with Michal Ajdarów, and Łukasz Orlikowski) received the Best Paper Award at CONCUR 2026.
Aug 2026 I am on the PC for PLDI 2027.
Jul 2026 I presented our paper The Complexity of Nested Reset Counter Systems at LICS 2026.
Jun 2026 Our paper Reachability in Fixed-Dimensional Continuous VASS (with Michal Ajdarów, and Łukasz Orlikowski) was accepted at CONCUR 2026.
May 2026 I am on the PC for LICS 2027.
Apr 2026 Two of our papers - The Complexity of Nested Reset Counter Systems (with Franzisco Schmidt) and Hypersequent Calculi Have Ackermann Complexity (with Vitor Greati and Revantha Ramanayake) have been accepted at LICS 2026.
Apr 2026 Our paper State Space Estimation for DPOR-based Model Checkers (with Mohammad Hossein Khoshechin Jorshari, Rupak Majumdar, Umang Mathur and Minjian Zhang) was accepted at PLDI 2026.

About me

Hi! I am a post-doctoral researcher at the Max Planck Institute for Software Systems (MPI-SWS), working with Rupak Majumdar. I received my Ph.D. summa cum laude from the Technical University of Munich in 2024, supervised by Javier Esparza. From October 2024 to March 2025 I held a Vertretungsprofessur (interim professorship) at the Technical University of Munich.

My research concerns the algorithmic analysis of infinite-state systems. Such systems are models of computation whose state space is infinite, typically because they include unbounded data structures such as counters or stacks (e.g. vector addition systems, Petri nets and pushdown automata). My work focuses on

Designing optimal algorithms for analysing infinite-state systems, using tools from automata theory and well-quasi-orders
Developing tractable approximations when exact analysis is intractable, using tools from arithmetic theories
Applying these techniques to problems from verification, substructural logics, functional synthesis and AI planning

A. R. Balasubramanian

About me