K. V. Subrahmanyam

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