## Research InterestsComplexity Theory, Analysis of Algorithms. |

#### Current Students

##### See here for former students

- Om Prakash (Ph.D.)
- Purnata Ghosal (Ph.D.)
- Ankit Kumar Yadav (M.S.)

#### Teaching actvities

- Computability and Complexity - Jul-Nov, 2019
- Discrete Mathematics for Computer Science - Jan-Apr, 2019
- Pseudorandomness - Jan-Apr, 2019
- Modern Complexity Theory - Jan-May, 2018
- Logic and Combinatorics for Computer Science - Jul-Nov, 2017
- Computability and Complexity - Jul-Nov, 2017
- Languages, Machines and Computation - Jan-May, 2017
- Pseudorandomness - Jan-May, 2017
- Algorithmic Algebra - Aug-Nov, 2016
- Advanced Complexity Theory - Jan-Apr, 2016
- Logic and Combinatorics for Computer Science - Aug-Nov, 2015
- Advanced Theory of Computation - Aug-Nov, 2015
- Languages, Machines and Computations - Jan-May, 2015
- Communication Complexity (Self-Study) - Jan-May, 2015
- Mathematical Concepts for Computer Science - Jul-Nov, 2014
- Algorithmic Algebra - Jul-Nov, 2014
- Modern Techniques in Theory of Computation - Jan-May, 2014
- Advanced Complexity Theory - Jan-May, 2014
- Mathematical Concepts for Computer Science - Jul-Nov, 2013
- Advanced Theory of Computation - Jul-Nov, 2013
- Modern Techniques in Theory of Computation - Jan-May, 2013

#### Projects/Funding

##### Only last five listed here. See here for more.

- Algebraic and Parameterized Complexities (Funding Agency : IMPECS)
- Smoothed Analysis of Discrete Approximation Algorithms (Funding Agency : NFSG)

#### Publications (while at IITM, 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**On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models**Authors: Purnata Ghosal, Raghavendra Rao B V

25th International Computing and Combinatorics Conference, COCOON 2019, Aug 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**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**On Weak-Space Complexity over Complex Numbers**Authors: Pushkar Joglekar, Siddhartha Sivakumar, Raghavendra Rao B V

21st International Symposium on Fundamentals of Computation Theory (FCT 2017), Sep 2017**On depth five Sum-Power-Sum-Power-Sum Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree**Authors: Christian Engels, Raghavendra Rao B V, Karteek Sreenivasaiah

21st International Symposium on Fundamentals of Computation Theory (FCT 2017), Sep 2017**Testing Equivalence of Polynomials under Scaling**Authors: Markus Blaser, Raghavendra Rao B V, Jayalal Sarma

21st International Symposium on Fundamentals of Computation Theory (FCT), Sep 2017**On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction**Authors: Purnata Ghosal, Om Prakash, Raghavendra Rao B V

23rd Annual International Computing and Combinatorics Conference (COCOON 2017), Aug 2017**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