On the Power of Enumerative Counting. - Sanjeev Saluja; K. V. Subrahmanyam 001 (Inf. Process. Lett., 1992)

Directed vs. Undirected Monotone Contact Networks for Threshold Functions - Magnús M. Halldórsson; Jaikumar Radhakrishnan; K. V. Subrahmanyam 001 (FOCS, 1993)

On Some Communication Complexity Problems Related to THreshold Functions. - Magnús M. Halldórsson; Jaikumar Radhakrishnan; K. V. Subrahmanyam 001 (FSTTCS, 1993)

Directed Monotone Contact Networks for Threshold Functions. - Jaikumar Radhakrishnan; K. V. Subrahmanyam 001 (Inf. Process. Lett., 1994)

Abstract and Generic Rigidity in the Plane. - Sachin B. Patkar; Brigitte Servatius; K. V. Subrahmanyam 001 (J. Comb. Theory B, 1994)

Descriptive Complexity of #P Functions. - Sanjeev Saluja; K. V. Subrahmanyam 001; Madhukar N. Thakur (J. Comput. Syst. Sci., 1995)

Computing Mimicking Networks. - Shiva Chaudhuri; K. V. Subrahmanyam 001; Frank Wagner 001; Christos D. Zaroliagis (Algorithmica, 2000)

Solving Some Discrepancy Problems in NC. - Sanjeev Mahajan; Edgar A. Ramos; K. V. Subrahmanyam 001 (Algorithmica, 2001)

The Query Complexity of Program Checking by Constant-Depth Circuits. - Vikraman Arvind; K. V. Subrahmanyam 001; N. V. Vinodchandran (Chic. J. Theor. Comput. Sci., 2002)

Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C) - Bharat Adsul; Milind A. Sohoni; K. V. Subrahmanyam 001 (CoRR, 2009)

On generating the ring of matrix semi-invariants. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (CoRR, 2015)

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (CoRR, 2015)

Invariant representations of images for better learning. - Muthuvel Murugan Issakkimuthu; K. V. Subrahmanyam 001 (ESANN, 2017)

Non-commutative Edmonds' problem and matrix semi-invariants. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (Comput. Complex., 2017)

Constructive non-commutative rank computation is in deterministic polynomial time. - Gábor Ivanyos; Youming Qiao; K. V. Subrahmanyam 001 (Comput. Complex., 2018)

SO(2)-equivariance in Neural networks using tensor nonlinearity. - Muthuvel Murugan Issakkimuthu; K. V. Subrahmanyam 001 (BMVC, 2019)

Invariance vs. Robustness of Neural Networks. - Sandesh Kamath; Amit Deshpande 001; K. V. Subrahmanyam 001 (CoRR, 2020)

Universalization of any adversarial attack using very few test examples. - Sandesh Kamath; Amit Deshpande 001; K. V. Subrahmanyam 001 (CoRR, 2020)

On Universalized Adversarial and Invariant Perturbations. - Sandesh Kamath; Amit Deshpande 001; K. V. Subrahmanyam 001 (CoRR, 2020)

How do SGD hyperparameters in natural training affect adversarial robustness? - Sandesh Kamath; Amit Deshpande 001; K. V. Subrahmanyam 001 (CoRR, 2020)

Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks. - Sandesh Kamath; Amit Deshpande 001; Subrahmanyam Kambhampati Venkata; Vineeth N. Balasubramanian (NeurIPS, 2021)

Universalization of Any Adversarial Attack using Very Few Test Examples. - Sandesh Kamath; Amit Deshpande 001; K. V. Subrahmanyam 001; Vineeth N. Balasubramanian (COMAD/CODS, 2022)

Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points. - Bharat Adsul; Milind A. Sohoni; K. V. Subrahmanyam 001 (CoRR, 2022)

Orbit closures, stabilizer limits and intermediate G-varieties. - Bharat Adsul; Milind A. Sohoni; K. V. Subrahmanyam 001 (CoRR, 2023)