Sivaramakrishnan Natarajan Ramamoorthy

17 papers A* 2A 4Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2020 J jnl
Edge Estimation with Independent Set Oracles.
ACM Trans. Algorithms
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2020 A conf
Equivalence of Systematic Linear Data Structures and Matrix Rigidity.
ITCS
Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian
2020 A* conf
How to Solve Fair k-Center in Massive Data Models.
ICML
Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy
2020 J jnl
How to Solve Fair k-Center in Massive Data Models.
CoRR
Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy
2020 — —
Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics.
Sivaramakrishnan Natarajan Ramamoorthy
2019 J jnl
Equivalence of Systematic Linear Data Structures and Matrix Rigidity.
CoRR
Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian
2019 J jnl
Equivalence of Systematic Linear Data Structures and Matrix Rigidity.
Electron. Colloquium Comput. Complex.
Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian
2019 A* conf
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.
ICALP
Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff
2019 J jnl
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.
Electron. Colloquium Comput. Complex.
Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff
2018 A conf
Edge Estimation with Independent Set Oracles.
ITCS
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2018 A conf
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers.
CCC
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
2017 J jnl
Edge Estimation with Independent Set Oracles.
CoRR
Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha
2017 J jnl
Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers.
Electron. Colloquium Comput. Complex.
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
2016 J jnl
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity.
Electron. Colloquium Comput. Complex.
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
2015 A conf
How to Compress Asymmetric Communication.
CCC
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
2015 J jnl
How to Compress Asymmetric Communication.
Electron. Colloquium Comput. Complex.
Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao
2015 — conf
On the communication complexity of greater-than.
Allerton
Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha