K. V. Subrahmanyam

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 12

Top Topics

Invariant Representations

Top Venues

Comput. Complex.

Publications

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam
Orbit closures, stabilizer limits and intermediate G-varieties. CoRR (2023)
Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam, Vineeth N. Balasubramanian
Universalization of Any Adversarial Attack using Very Few Test Examples. COMAD/CODS (2022)
Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam
Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points. CoRR (2022)
Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam
Invariance vs. Robustness of Neural Networks. CoRR (2020)
Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam
Universalization of any adversarial attack using very few test examples. CoRR (2020)
Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam
How do SGD hyperparameters in natural training affect adversarial robustness? CoRR (2020)
Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam
On Universalized Adversarial and Invariant Perturbations. CoRR (2020)
Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam
SO(2)-equivariance in Neural networks using tensor nonlinearity. BMVC (2019)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27 (4) (2018)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26 (3) (2017)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS (2017)
Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam
Invariant representations of images for better learning. ESANN (2017)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
On generating the ring of matrix semi-invariants. CoRR (2015)
Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam
(C) CoRR (2009)
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. 2002 (2002)
Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. Algorithmica 29 (3) (2001)
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. Algorithmica 26 (1) (2000)
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC (1999)
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
The Query Complexity of Program Checking by Constant-Depth Circuits Electron. Colloquium Comput. Complex. 5 (78) (1998)
Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
Computing Mimicking Networks. ICALP (1998)
Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
Solving Some Discrepancy Problems in NC. FSTTCS (1997)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50 (3) (1995)
Jaikumar Radhakrishnan, K. V. Subrahmanyam
Directed Monotone Contact Networks for Threshold Functions. Inf. Process. Lett. 50 (4) (1994)
Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam
Abstract and Generic Rigidity in the Plane. J. Comb. Theory, Ser. B 62 (1) (1994)
Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
On Some Communication Complexity Problems Related to THreshold Functions. FSTTCS (1993)
Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
Directed vs. Undirected Monotone Contact Networks for Threshold Functions FOCS (1993)
Sanjeev Saluja, K. V. Subrahmanyam
On the Power of Enumerative Counting. Inf. Process. Lett. 43 (3) (1992)
Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Descriptive Complexity of #P Functions. Computational Complexity Conference (1992)