Density Functions subject to a Co-Matroid Constraint. - Venkatesan T. Chakaravarthy; Natwar Modani; Sivaramakrishnan R. Natarajan; Sambuddha Roy; Yogish Sabharwal (FSTTCS, 2012)

Knapsack Cover Subject to a Matroid Constraint. - Venkatesan T. Chakaravarthy; Anamitra R. Choudhury; Sivaramakrishnan R. Natarajan; Sambuddha Roy (FSTTCS, 2013)

On the communication complexity of greater-than. - Sivaramakrishnan Natarajan Ramamoorthy; Makrand Sinha (Allerton, 2015)

How to Compress Asymmetric Communication. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2015)

New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2016)

Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2017)

Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. - Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001 (CCC, 2018)

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. - Pavel Hrubes; Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2019)

Equivalence of Systematic Linear Data Structures and Matrix Rigidity. - Sivaramakrishnan Natarajan Ramamoorthy; Cyrus Rashtchian (Electron. Colloquium Comput. Complex., 2019)

How to Solve Fair k-Center in Massive Data Models. - Ashish Chiplunkar; Sagar Sudhir Kale; Sivaramakrishnan Natarajan Ramamoorthy (ICML, 2020)

Edge Estimation with Independent Set Oracles. - Paul Beame; Sariel Har-Peled; Sivaramakrishnan Natarajan Ramamoorthy; Cyrus Rashtchian; Makrand Sinha (ACM Trans. Algorithms, 2020)

Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics. - Sivaramakrishnan Natarajan Ramamoorthy (2020)