( en | de | ru )

 

Disambiguation of "Ramamoorthy, Sivaramakrishnan Natarajan"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.

, , , and . ICALP, volume 132 of LIPIcs, page 72:1-72:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ramamoorthy Acharya

Kasyap Natarajan

Paruthiure Natarajan

Natarajan Thiagarajan

Arupon Natarajan

 

Other publications of authors with the same name

How to Compress Asymmetric Communication., and . CCC, volume 33 of LIPIcs, page 102-123. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)How to Solve Fair k-Center in Massive Data Models., , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 1877-1886. PMLR, (2020)Equivalence of Systematic Linear Data Structures and Matrix Rigidity., and . ITCS, volume 151 of LIPIcs, page 35:1-35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Equivalence of Systematic Linear Data Structures and Matrix Rigidity., and . Electron. Colloquium Comput. Complex., (2019)Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers., and . Electron. Colloquium Comput. Complex., (2017)On the communication complexity of greater-than., and . Allerton, page 442-444. IEEE, (2015)Edge Estimation with Independent Set Oracles., , , , and . ITCS, volume 94 of LIPIcs, page 38:1-38:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Edge Estimation with Independent Set Oracles., , , , and . ACM Trans. Algorithms, 16 (4): 52:1-52:27 (2020)New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity., and . Electron. Colloquium Comput. Complex., (2016)Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics.. University of Washington, USA, (2020)