Evaluating Monotone Circuits on Cylinders, Planes and Tori - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2006)

On the Complexity of Rank and Rigidity. - Meena Mahajan; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2006)

Rigidity of a simple extended lower triangular matrix. - Meena Mahajan; Jayalal Sarma (Inf. Process. Lett., 2008)

On the Complexity of Matroid Isomorphism Problems. - B. V. Raghavendra Rao; Jayalal Sarma (CSR, 2009)

Upper Bounds for Monotone Planar Circuit Value and Variants. - Nutan Limaye; Meena Mahajan; Jayalal Sarma (Comput. Complex., 2009)

Limiting Negations in Bounded Treewidth and Upward Planar Circuits. - Jing He 009; Hongyu Liang; Jayalal Sarma (MFCS, 2010)

Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

Deterministic Identity Testing of Read-Once Algebraic Branching Programs. - Maurice J. Jansen; Youming Qiao; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2010)

On the Complexity of Matrix Rank and Rigidity. - Meena Mahajan; Jayalal Sarma (Theory Comput. Syst., 2010)

On the Complexity of Matroid Isomorphism Problem. - B. V. Raghavendra Rao; Jayalal Sarma (Theory Comput. Syst., 2011)

On Isomorphism Testing of Groups with Normal Hall Subgroups. - Youming Qiao; Jayalal Sarma; Bangsheng Tang (J. Comput. Sci. Technol., 2012)

On Directed Tree Realizations of Degree Sets. - Prasun Kumar; Jayalal Sarma; Saurabh Sawlani (WALCOM, 2013)

Pebbling, Entropy and Branching Program Size Lower Bounds. - Balagopal Komarath; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2013)

Arithmetic Circuit Lower Bounds via MaxRank. - Mrinal Kumar 001; Gaurav Maheshwari 002; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2013)

Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (FSTTCS, 2014)

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. - Kristoffer Arnsfelt Hansen; Balagopal Komarath; Jayalal Sarma; Sven Skyum; Navid Talebanfard (MFCS (2), 2014)

Using Elimination Theory to Construct Rigid Matrices. - Abhinav Kumar 006; Satyanarayana V. Lokam; Vijay M. Patankar; Jayalal Sarma (Comput. Complex., 2014)

Complexity of Testing Reachability in Matroids. - B. V. Raghavendra Rao; Jayalal Sarma (Chic. J. Theor. Comput. Sci., 2014)

Balancing Bounded Treewidth Circuits. - Maurice J. Jansen; Jayalal Sarma (Theory Comput. Syst., 2014)

Reversible Pebble Game on Trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (COCOON, 2015)

Comparator Circuits over Finite Bounded Posets. - K. S. Sunil; Balagopal Komarath; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2015)

Characterization and Lower Bounds for Branching Program Size using Projective Dimension. - Krishnamoorthy Dinesh 001; Sajin Koroth; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2016)

On the Complexity of L-reachability. - Balagopal Komarath; Jayalal Sarma; K. S. Sunil (Fundam. Informaticae, 2016)

Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. - Mrinal Kumar 001; Gaurav Maheshwari 002; Jayalal Sarma (ACM Trans. Comput. Theory, 2016)

Testing Polynomial Equivalence by Scaling Matrices. - Markus Bläser; B. V. Raghavendra Rao; Jayalal Sarma (FCT, 2017)

Depth Lower Bounds against Circuits with Sparse Orientation. - Sajin Koroth; Jayalal Sarma (Fundam. Informaticae, 2017)

Min/Max-Poly Weighting Schemes and the NL versus UL Problem. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (ACM Trans. Comput. Theory, 2017)

Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. - Krishnamoorthy Dinesh 001; Jayalal Sarma (CALDAM, 2018)

Pebbling meets coloring: Reversible pebble game on trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (J. Comput. Syst. Sci., 2018)

Space complexity of reachability testing in labelled graphs. - Vidhya Ramaswamy; Jayalal Sarma; K. S. Sunil (J. Comput. Syst. Sci., 2019)

Alternation, sparsity and sensitivity: Bounds and exponential gaps. - Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2019)

On the Mystery of Negations in Circuits: Structure vs Power. - Prashanth Amireddy; Sai Jayasurya; Jayalal Sarma (COCOON, 2020)

New bounds for energy complexity of Boolean functions. - Krishnamoorthy Dinesh 001; Samir Otiv; Jayalal Sarma (Theor. Comput. Sci., 2020)

Sensitivity, affine transforms and quantum communication complexity. - Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2020)

On the Computational Power of Programs over BA2 Monoid. - Manasi S. Kulkarni; Jayalal Sarma; Janani Sundaresan (LATA, 2021)

Power of Decision Trees with Monotone Queries. - Prashanth Amireddy; Sai Jayasurya; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2022)

Isomorphism testing of read-once functions and polynomials. - B. V. Raghavendra Rao; Jayalal Sarma (Inf. Comput., 2022)

On pure space vs catalytic space. - Sagar Bisoyi; Krishnamoorthy Dinesh 001; Jayalal Sarma (Theor. Comput. Sci., 2022)

Separating Words Problem over Groups. - Neha Kuntewar; S. K. M. Anoop; Jayalal Sarma (DCFS, 2023)

Energy and Output Patterns in Boolean Circuits. - Jayalal Sarma; Kei Uchizawa (TAMC, 2024)

Almost-catalytic Computation. - Sagar Bisoyi; Krishnamoorthy Dinesh 001; Bhabya Rai; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2024)

On Rotation Distance of Rank Bounded Trees. - S. K. M. Anoop; Jayalal Sarma (Fundam. Informaticae, 2024)

Avoiding Range via Turan-Type Bounds. - Neha Kuntewar; Jayalal Sarma (APPROX/RANDOM, 2025)

Almost-Catalytic Computation. - Sagar Bisoyi; Krishnamoothy Dinesh; Bhabya Rai; Jayalal Sarma (CIAC (2), 2025)

Sensitivity and Query Complexity Under Uncertainty. - Deepu Benson; Balagopal Komarath; Nikhil S. Mande; Nalli Sai Soumya; Jayalal Sarma; Karteek Sreenivasaiah (MFCS, 2025)

Range Avoidance in Boolean Circuits via Turan-type Bounds. - Neha Kuntewar; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2025)

Hazard-free Decision Trees. - Deepu Benson; Balagopal Komarath; Jayalal Sarma; Nalli Sai Soumya (CoRR, 2025)