Sivaramakrishnan Natarajan Ramamoorthy

According to our database, Sivaramakrishnan Natarajan Ramamoorthy authored at least 12 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics.

Sivaramakrishnan Natarajan Ramamoorthy

PhD thesis, 2020

Equivalence of Systematic Linear Data Structures and Matrix Rigidity.

Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

How to Solve Fair k-Center in Massive Data Models.

Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.

Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Edge Estimation with Independent Set Oracles.

Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers.

Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers.

Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao

Electron. Colloquium Comput. Complex., 2017

2016

New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity.

Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao

Electron. Colloquium Comput. Complex., 2016

2015

How to Compress Asymmetric Communication.

Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao

Proceedings of the 30th Conference on Computational Complexity, 2015

On the communication complexity of greater-than.

Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2013

Knapsack Cover Subject to a Matroid Constraint.

Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Density Functions subject to a Co-Matroid Constraint.

Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012