| Edge estimation with independent set oracles P Beame, S Har-Peled, SN Ramamoorthy, C Rashtchian, M Sinha ACM Transactions on Algorithms (TALG) 16 (4), 1-27, 2020 | 57 | 2020 |
| How to solve fair k-center in massive data models A Chiplunkar, S Kale, SN Ramamoorthy International Conference on Machine Learning, 1877-1886, 2020 | 47 | 2020 |
| Lower bounds on non-adaptive data structures maintaining sets of numbers, from sunflowers S Natarajan Ramamoorthy, A Rao 33rd Computational Complexity Conference (CCC 2018), 2018 | 17* | 2018 |
| How to compress asymmetric communication S Natarajan Ramamoorthy, A Rao 30th Conference on Computational Complexity (CCC 2015), 2015 | 17 | 2015 |
| On the communication complexity of greater-than. SN Ramamoorthy, M Sinha Allerton, 442-444, 2015 | 15 | 2015 |
| Lower bounds on balancing sets and depth-2 threshold circuits P Hrubes, S Natarajan Ramamoorthy, A Rao, A Yehudayoff 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 13 | 2019 |
| Equivalence of systematic linear data structures and matrix rigidity S Natarajan Ramamoorthy, C Rashtchian 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 12 | 2020 |
| Knapsack cover subject to a matroid constraint VT Chakaravarthy, AR Choudhury, SR Natarajan, S Roy IARCS Annual Conference on Foundations of Software Technology and …, 2013 | 6 | 2013 |
| Density functions subject to a co-matroid constraint VT Chakaravarthy, N Modani, SR Natarajan, S Roy, Y Sabharwal arXiv preprint arXiv:1207.5215, 2012 | 5 | 2012 |
| Simplified data structure lower bounds for dynamic graph connectivity SN Ramamoorthy, A Rao Electronic Colloquium on Computational Complexity (ECCC) 23, 167, 2016 | 2 | 2016 |
| Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics SN Ramamoorthy University of Washington Libraries, 2020 | | 2020 |
