default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. V. Subrahmanyam 0001
Person information
- affiliation: Chennai Mathematical Institute, Chennai, India
Other persons with the same name
- K. V. Subrahmanyam 0002
![[0000-0003-2987-1232]](/https://anthro-https-dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2987-1232")
— Trivandrum, India
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2023
[i11]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Orbit closures, stabilizer limits and intermediate G-varieties. CoRR abs/2309.15816 (2023)- 2022
- [c11]Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam, Vineeth N. Balasubramanian:
Universalization of Any Adversarial Attack using Very Few Test Examples. COMAD/CODS 2022: 72-80 - [i10]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points. CoRR abs/2201.00135 (2022) - 2021
- [c10]Sandesh Kamath, Amit Deshpande, Subrahmanyam Kambhampati Venkata, Vineeth N. Balasubramanian:
Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks. NeurIPS 2021: 27462-27474 - 2020
- [i9]Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam:
Invariance vs. Robustness of Neural Networks. CoRR abs/2002.11318 (2020) - [i8]Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam:
Universalization of any adversarial attack using very few test examples. CoRR abs/2005.08632 (2020) - [i7]Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam:
On Universalized Adversarial and Invariant Perturbations. CoRR abs/2006.04449 (2020) - [i6]Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam:
How do SGD hyperparameters in natural training affect adversarial robustness? CoRR abs/2006.11604 (2020)
2010 – 2019
- 2019
- [c9]Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam:
SO(2)-equivariance in Neural networks using tensor nonlinearity. BMVC 2019: Article 86 - 2018
- [j9]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27(4): 561-593 (2018) - 2017
- [j8]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26(3): 717-763 (2017) - [c8]Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam:
Invariant representations of images for better learning. ESANN 2017 - [c7]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS 2017: 55:1-55:19 - 2015
- [i5]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR abs/1508.00690 (2015) - [i4]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
On generating the ring of matrix semi-invariants. CoRR abs/1508.01554 (2015) - [i3]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR abs/1512.03531 (2015)
2000 – 2009
- 2009
- [i2]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C). CoRR abs/0905.0094 (2009) - 2002
- [j7]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) - 2001
- [j6]Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam:
Solving Some Discrepancy Problems in NC. Algorithmica 29(3): 371-395 (2001) - 2000
- [j5]Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. Algorithmica 26(1): 31-49 (2000)
1990 – 1999
- 1999
- [c6]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132 - 1998
- [c5]Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis:
Computing Mimicking Networks. ICALP 1998: 556-567 - [i1]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR98: Article TR98-078 (1998) - 1997
- [c4]Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam:
Solving Some Discrepancy Problems in NC. FSTTCS 1997: 22-36 - 1995
- [j4]Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur:
Descriptive Complexity of #P Functions. J. Comput. Syst. Sci. 50(3): 493-505 (1995) - 1994
- [j3]Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed Monotone Contact Networks for Threshold Functions. Inf. Process. Lett. 50(4): 199-203 (1994) - [j2]Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam:
Abstract and Generic Rigidity in the Plane. J. Comb. Theory B 62(1): 107-113 (1994) - 1993
- [c3]Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed vs. Undirected Monotone Contact Networks for Threshold Functions. FOCS 1993: 604-613 - [c2]Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
On Some Communication Complexity Problems Related to THreshold Functions. FSTTCS 1993: 248-259 - 1992
- [j1]Sanjeev Saluja, K. V. Subrahmanyam:
On the Power of Enumerative Counting. Inf. Process. Lett. 43(3): 119-125 (1992) - [c1]Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur:
Descriptive Complexity of #P Functions. SCT 1992: 169-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-26 01:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
