default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSivaramakrishnan Natarajan Ramamoorthy
Person information
- affiliation: University of Washington, Paul G. Allen School of Computer Science & Engineering, Seattle, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[b1]Sivaramakrishnan Natarajan Ramamoorthy:
Lower Bounds in Computational Complexity from Information Theory, Algebra and Combinatorics. University of Washington, USA, 2020- [j1]Paul Beame
, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms 16(4): 52:1-52:27 (2020) - [c9]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. ICML 2020: 1877-1886 - [c8]Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian:
Equivalence of Systematic Linear Data Structures and Matrix Rigidity. ITCS 2020: 35:1-35:20 - [i9]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. CoRR abs/2002.07682 (2020)
2010 – 2019
- 2019
- [c7]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. ICALP 2019: 72:1-72:14 - [i8]Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian:
Equivalence of Systematic Linear Data Structures and Matrix Rigidity. CoRR abs/1910.11921 (2019) - [i7]Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i6]Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian:
Equivalence of Systematic Linear Data Structures and Matrix Rigidity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c6]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. CCC 2018: 27:1-27:16 - [c5]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. ITCS 2018: 38:1-38:21 - 2017
- [i5]Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. CoRR abs/1711.07567 (2017) - [i4]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c4]Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha:
On the communication complexity of greater-than. Allerton 2015: 442-444 - [c3]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
How to Compress Asymmetric Communication. CCC 2015: 102-123 - [i2]Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
How to Compress Asymmetric Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [c2]Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy:
Knapsack Cover Subject to a Matroid Constraint. FSTTCS 2013: 275-286 - 2012
- [c1]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. FSTTCS 2012: 236-248 - [i1]Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. CoRR abs/1207.5215 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
