default search action
C. Ramya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]C. Ramya, Pratik Shastri:
Lower Bounds for Planar Arithmetic Circuits. ITCS 2024: 91:1-91:22 - 2023
- [c9]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS 2023: 6:1-6:23 - [i21]C. Ramya, Pratik Shastri:
Lower Bounds for Planar Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c8]Malliga Subramanian, Sathishkumar V. E.
, C. Ramya, Shanmuga Vadivel Kogilavani, Deepti Ravi:
A Lightweight Depthwise Separable Convolution Neural Network for Screening Covid-19 Infection from Chest CT and X-ray Images. DCOSS 2022: 410-413 - [c7]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP Is Hard, Then so Are Equations for It. STACS 2022: 44:1-44:13 - [c6]C. Ramya, Anamay Tengse:
On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. STACS 2022: 53:1-53:23 - [i20]C. Ramya, Anamay Tengse:
On Finer Separations between Subclasses of Read-once Oblivious ABPs. CoRR abs/2201.06432 (2022) - [i19]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR abs/2209.04797 (2022) - [i18]C. Ramya, Anamay Tengse:
On Finer Separations between Subclasses of Read-once Oblivious ABPs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j5]C. Priya, C. Ramya:
Robust and Secure Video Watermarking Based on Cellular Automata and Singular Value Decomposition for Copyright Protection. Circuits Syst. Signal Process. 40(5): 2464-2493 (2021) - [j4]N. Rathina Kumar, C. Ramya:
An Enhanced Hybrid Watermarking Method and Imaging System for Securing Medical Images. J. Medical Imaging Health Informatics 11(11): 2754-2764 (2021) - [i17]C. Ramya, K. S. Shreedhara:
A PSO Strategy of Finding Relevant Web Documents using a New Similarity Measure. CoRR abs/2103.14371 (2021) - 2020
- [j3]C. Ramya, B. V. Raghavendra Rao
Lower bounds for special cases of syntactic multilinear ABPs. Theor. Comput. Sci. 809: 1-20 (2020) - [c5]Prerona Chatterjee
On the Existence of Algebraically Natural Proofs. FOCS 2020: 870-880 - [i16]Prerona Chatterjee
On the Existence of Algebraically Natural Proofs. CoRR abs/2004.14147 (2020) - [i15]C. Ramya:
Recent Progress on Matrix Rigidity - A Survey. CoRR abs/2009.09460 (2020) - [i14]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. CoRR abs/2012.07056 (2020) - [i13]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i12]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]C. Ramya, B. V. Raghavendra Rao
Linear projections of the Vandermonde polynomial. Theor. Comput. Sci. 795: 165-182 (2019) - [j1]C. Ramya, B. V. Raghavendra Rao
Lower bounds for Sum and Sum of Products of Read-once Formulas. ACM Trans. Comput. Theory 11(2): 10:1-10:27 (2019) - [c4]C. Ramya, B. V. Raghavendra Rao
Lower Bounds for Multilinear Order-Restricted ABPs. MFCS 2019: 52:1-52:14 - [i11]C. Ramya, B. V. Raghavendra Rao:
Lower bounds for multilinear bounded order ABPs. CoRR abs/1901.04377 (2019) - 2018
- [c3]N. S. Narayanaswamy, S. M. Dhannya, C. Ramya:
Minimum Membership Hitting Sets of Axis Parallel Segments. COCOON 2018: 638-649 - [c2]C. Ramya, B. V. Raghavendra Rao
Lower Bounds for Special Cases of Syntactic Multilinear ABPs. COCOON 2018: 701-712 - [i10]C. Ramya, B. V. Raghavendra Rao:
Lower Bounds for Special Cases of Syntactic Multilinear ABPs. CoRR abs/1804.08810 (2018) - 2017
- [i9]C. Ramya, B. V. Raghavendra Rao:
Linear Projections of the Vandermonde Polynomial. CoRR abs/1705.03188 (2017) - [i8]C. Ramya, B. V. Raghavendra Rao:
Linear Projections of the Vandermonde Polynomial. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c1]Ramya C., B. V. Raghavendra Rao
Sum of Products of Read-Once Formulas. FSTTCS 2016: 39:1-39:15 - 2015
- [i7]C. Ramya, B. V. Raghavendra Rao:
Limitations of sum of products of Read-Once Polynomials. CoRR abs/1512.03607 (2015) - [i6]C. Ramya, B. V. Raghavendra Rao:
Limitations of sum of products of Read-Once Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - 2012
- [i5]C. Ramya, G. Kavitha, K. S. Shreedhara:
Dynamic Grouping of Web Users Based on Their Web Access Patterns using ART1 Neural Network Clustering Algorithm. CoRR abs/1205.1938 (2012) - 2011
- [i4]C. Ramya, K. S. Shreedhara, G. Kavitha:
Preprocessing: A Prerequisite for Discovering Patterns in WUM Process. CoRR abs/1104.2284 (2011) - [i3]C. Ramya, G. Kavitha, K. S. Shreedhara:
Recalling of Images using Hopfield Neural Network Model. CoRR abs/1105.0332 (2011) - [i2]C. Ramya, G. Kavitha, K. S. Shreedhara:
Preprocessing: A Prerequisite for Discovering Patterns in Web Usage Mining Process. CoRR abs/1105.0350 (2011) - [i1]C. Ramya, G. Kavitha:
An Efficient Preprocessing Methodology for Discovering Patterns and Clustering of Web Users using a Dynamic ART1 Neural Network. CoRR abs/1109.1211 (2011)
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-10-07 21:16 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: