Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.

## Research InterestsComplexity Theory, Algebra & Computation## Moved to:Postdoc, Chennai Mathematical Institute, Chennai, India. |

#### Teaching Actvities (while with the theory group - since Jan 2011)

- TA for Modern Complexity Theory - Jan-May, 2018
- TA for Computability and Complexity - Jul-Nov, 2017
- TA for Languages, Machines and Computation - Jan-May, 2017
- TA for Algorithmic Algebra - Aug-Nov, 2016
- TA for Algorithmic Algebra - Aug-Nov, 2015
- TA for Advanced Complexity Theory - Jan-May, 2015
- TA for Advanced Theory of Computation - Jul-Nov, 2014
- TA for Languages, Machines and Computations - Jan-May, 2014

#### Publications (while with the group, last 10)

##### See here for all publications while at IITM

**Lower Bounds for Multilinear Order-restricted ABPs**Authors: Ramya C., Raghavendra Rao B V

44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Sep 2019**Linear projections of the Vandermonde polynomial**Authors: Ramya C., Raghavendra Rao B V

TCS, Theoretical Computer Science, Jul 2019**Lower bounds for Sum and Sum of Products of Read-once Formulas**Authors: Ramya C., Raghavendra Rao B V

ToCT, ACM Transactions on Computation Theory, Vol 11, No.2, pp.10:1-10:27, May 2019**Minimum Membership Hitting Sets of Axis Parallel Segments**Authors: Narayanaswamy N S, Dhannya S.M., Ramya C.

The 24th International Computing and Combinatorics Conference (COCOON 2018), LNCS, Jul 2018**Lower Bounds for Special Classes of Syntactic Multilinear ABPs**Authors: Ramya C., Raghavendra Rao B V

The 24th International Computing and Combinatorics Conference (COCOON 2018), Jul 2018**Sum of products of Read-Once Polynomials**Authors: Ramya C., Raghavendra Rao B V

36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016