K. V. Subrahmanyam

Orcid: 0000-0002-0104-4086

Affiliations:
  • Chennai Mathematical Institute, Chennai, India


According to our database1, K. V. Subrahmanyam authored at least 24 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Orbit closures, stabilizer limits and intermediate G-varieties.
CoRR, 2023

2022
Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points.
CoRR, 2022

Universalization of Any Adversarial Attack using Very Few Test Examples.
Proceedings of the CODS-COMAD 2022: 5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD), Bangalore, India, January 8, 2022

2021
Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
How do SGD hyperparameters in natural training affect adversarial robustness?
CoRR, 2020

On Universalized Adversarial and Invariant Perturbations.
CoRR, 2020

Universalization of any adversarial attack using very few test examples.
CoRR, 2020

Invariance vs. Robustness of Neural Networks.
CoRR, 2020

2019
SO(2)-equivariance in Neural networks using tensor nonlinearity.
Proceedings of the 30th British Machine Vision Conference 2019, 2019

2018
Constructive non-commutative rank computation is in deterministic polynomial time.
Comput. Complex., 2018

2017
Non-commutative Edmonds' problem and matrix semi-invariants.
Comput. Complex., 2017

Invariant representations of images for better learning.
Proceedings of the 25th European Symposium on Artificial Neural Networks, 2017

2015
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.
CoRR, 2015

On generating the ring of matrix semi-invariants.
CoRR, 2015

2009
Quantum deformations of the restriction of GL<sub>mn</sub>(C)-modules to GL<sub>m</sub>(C) × GL<sub>n</sub>(C)
CoRR, 2009

2002
The Query Complexity of Program Checking by Constant-Depth Circuits.
Chic. J. Theor. Comput. Sci., 2002

2001
Solving Some Discrepancy Problems in NC.
Algorithmica, 2001

2000
Computing Mimicking Networks.
Algorithmica, 2000

1995
Descriptive Complexity of #P Functions.
J. Comput. Syst. Sci., 1995

1994
Abstract and Generic Rigidity in the Plane.
J. Comb. Theory B, 1994

Directed Monotone Contact Networks for Threshold Functions.
Inf. Process. Lett., 1994

1993
On Some Communication Complexity Problems Related to THreshold Functions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Directed vs. Undirected Monotone Contact Networks for Threshold Functions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
On the Power of Enumerative Counting.
Inf. Process. Lett., 1992


  Loading...