Non-commutative Edmonds’ problem and matrix semi-invariants G Ivanyos, Y Qiao, KV Subrahmanyam computational complexity 26, 717-763, 2017 | 74 | 2017 |

Descriptive complexity of# P functions S Saluja, KV Subrahmanyam, MN Thakur Journal of Computer and System Sciences 50 (3), 493-505, 1995 | 70 | 1995 |

Constructive non-commutative rank computation is in deterministic polynomial time G Ivanyos, Y Qiao, KV Subrahmanyam computational complexity 27, 561-593, 2018 | 56 | 2018 |

Constructive non-commutative rank computation is in deterministic polynomial time G Ivanyos, Y Qiao, KV Subrahmanyam 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 38* | 2017 |

Computing mimicking networks S Chaudhuri, KV Subrahmanyam, F Wagner, CD Zaroliagis Algorithmica 26, 31-49, 2000 | 35 | 2000 |

Cohomology of line bundles on Schubert varieties—I V Balaji, SS Kannan, KV Subrahmanyam Transformation groups 9, 103-131, 2004 | 24 | 2004 |

A geometric approach to the Kronecker problem II: Invariants of matrices for simultaneous left-right actions B Adsul, S Nayak, KV Subrahmanyam Manuscript, available in http://www. cmi. ac. in/kv/ANS10. pdf 18, 2010 | 19* | 2010 |

Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks S Kamath, A Deshpande, S Kambhampati Venkata, ... Advances in Neural Information Processing Systems 34, 27462-27474, 2021 | 15* | 2021 |

Solving some discrepancy problems in NC S Mahajan, EA Ramos, KV Subrahmanyam International Conference on Foundations of Software Technology and …, 1997 | 10 | 1997 |

Torus quotients of Richardson varieties in the Grassmannian S Bakshi, S Senthamarai Kannan, S K. Venkata Communications in Algebra 48 (2), 891-914, 2020 | 9 | 2020 |

Directed vs. undirected monotone contact networks for threshold functions MM Halldórsson, J Radhakrishnan, KV Subrahmanyam Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 604-613, 1993 | 9 | 1993 |

Solving some discrepancy problems in NC S Mahajan, EA Ramos, KV Subrahmanyam Algorithmica 29 (3), 371-395, 2001 | 7 | 2001 |

A geometric approach to the Kronecker problem I: the two row case B Adsul, KV Subrahmanyam Proceedings Mathematical Sciences 118, 213-226, 2008 | 6 | 2008 |

Constructive non-commutative rank computation is in deterministic polynomial time. computational complexity, 27 (4): 561–593 G Ivanyos, Y Qiao, KV Subrahmanyam December, 2018 | 5 | 2018 |

Quantum deformations of the restriction of GLmn (C)-modules to GLm (C)× GLn (C) B Adsul, M Sohoni, KV Subrahmanyam arXiv preprint math.RT/0905.0094, 2009 | 5 | 2009 |

Directed monotone contact networks for threshold functions J Radhakrishnan, KV Subrahmanyam Information processing letters 50 (4), 199-203, 1994 | 5 | 1994 |

On generating the ring of matrix semi-invariants G Ivanyos, Y Qiao, KV Subrahmanyam arXiv preprint arXiv:1508.01554, 2015 | 4 | 2015 |

RSK bases and Kazhdan-Lusztig cells KN Raghavan, P Samuel, KV Subrahmanyam Annales de l'Institut Fourier 62 (2), 525-569, 2012 | 4* | 2012 |

Smooth torus quotients of Schubert varieties in the Grassmannian S Bakshi, SS Kannan, KV Subrahmanyam Indian Journal of Pure and Applied Mathematics, 1-6, 2024 | 3 | 2024 |

How do SGD hyperparameters in natural training affect adversarial robustness? S Kamath, A Deshpande, KV Subrahmanyam arXiv preprint arXiv:2006.11604, 2020 | 3 | 2020 |