C Ramya

Employment

• Institute of Mathematical Sciences Assistant Professor
  2022 - Present
• Chennai Mathematical Institute Assistant Professor
  2021 - 2022
• Tata Institute of Fundamental Research Postdoctoral Fellow
  2019 - 2021
• Chennai Mathematical Institute Visiting Research Fellow
  2019 - 2019

Education

• Indian Institute of Technology Madras Ph.D., in Computer Science
  2013 - 2018
• Madras Institute of Technology B.E., in Computer Science
  2009 - 2013

Projects & Funding

Projects & funding information is unavailable.

Publications (12)

• Lower Bounds for Planar Arithmetic Circuits
  Innovations in Theoretical Computer Science (ITCS) 2024 DOI: 10.4230/LIPICS.ITCS.2024.91
  +Save
• On Identity Testing and Noncommutative Rank Computation over the Free Skew Field
  Innovations in Theoretical Computer Science (ITCS) 2023 DOI: 10.4230/LIPICS.ITCS.2023.6
  +Save
• If VNP is hard, then so are equations for it
  International Symposium on Theoretical Aspects of Computer Science(STACS) 2022 DOI: 10.4230/LIPIcs.STACS.2022.44
  +Save
• On Finer Separations Between Subclasses of Read-Once Oblivious ABPs
  nternational Symposium on Theoretical Aspects of Computer Science (STACS) 2022 DOI: 10.4230/LIPIcs.STACS.2022.53
  +Save
• On the Existence of Algebraically Natural Proofs
  IEEE Annual Symposium on Foundations of Computer Science(FOCS) 2020 DOI: 10.1109/FOCS46700.2020.00085
  +Save
• Lower bounds for special cases of syntactic multilinear ABPs
  Theor. Comput. Sci. 2020 DOI: 10.1007/978-3-319-94776-1\_58
  +Save
• Recent Progress on Matrix Rigidity - A Survey
  CoRR 2020
  +Save
• Lower Bounds for Multilinear Order-Restricted ABPs
  International Symposium on Mathematical Foundations of Computer Science(MFCS) 2019 DOI: 10.4230/LIPIcs.MFCS.2019.52
  +Save
• Linear projections of the Vandermonde polynomial
  Theor. Comput. Sci. 2019 DOI: 10.1016/j.tcs.2019.06.010
  +Save
• Lower bounds for Sum and Sum of Products of Read-once Formulas
  ACM Trans. Comput. Theory 2019 DOI: 10.1145/3313232
  +Save