| 2021 | CSR | Limitations of Sums of Bounded Read Formulas and ABPs. | Purnata Ghosal, B. V. Raghavendra Rao |
| 2021 | STACS | Parameterised Counting in Logspace. | Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao |
| 2020 | COCOON | On Measures of Space over Real and Complex Numbers. | Om Prakash, B. V. Raghavendra Rao |
| 2019 | COCOON | On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models. | Purnata Ghosal, B. V. Raghavendra Rao |
| 2019 | MFCS | Lower Bounds for Multilinear Order-Restricted ABPs. | C. Ramya, B. V. Raghavendra Rao |
| 2018 | COCOON | Lower Bounds for Special Cases of Syntactic Multilinear ABPs. | C. Ramya, B. V. Raghavendra Rao |
| 2017 | COCOON | On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction. | Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao |
| 2017 | FCT | Testing Polynomial Equivalence by Scaling Matrices. | Markus Blser, B. V. Raghavendra Rao, Jayalal Sarma |
| 2017 | FCT | On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. | Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2017 | FCT | On Weak-Space Complexity over Complex Numbers. | Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar |
| 2016 | COCOON | On Hard Instances of Non-Commutative Permanent. | Christian Engels, B. V. Raghavendra Rao |
| 2014 | COCOON | Building above Read-once Polynomials: Identity Testing and Hardness of Representation. | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2013 | MFCS | Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. | Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao |
| 2012 | MFCS | Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah |
| 2011 | WADS | Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. | Markus Blser, Bodo Manthey, B. V. Raghavendra Rao |
| 2010 | MFCS | Counting Classes and the Fine Structure between NC | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
| 2009 | CSR | Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. | Maurice J. Jansen, B. V. Raghavendra Rao |
| 2009 | CSR | On the Complexity of Matroid Isomorphism Problems. | B. V. Raghavendra Rao, Jayalal Sarma |
| 2009 | FCT | Small-Space Analogues of Valiant's Classes. | Meena Mahajan, B. V. Raghavendra Rao |
| 2008 | MFCS | Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae. | Meena Mahajan, B. V. Raghavendra Rao |
| 2007 | STACS | Arithmetizing Classes Around NC | Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao |