## Research InterestsComplexity Theory, Analysis of Algorithms. |

#### Current Students

##### See here for former students

- Om Prakash (Ph.D.)
- Purnata Ghosal (Ph.D.)
- Ramya C. (Ph.D.)
- Ankit Kumar Yadav (M.S.)
- Subhadra Nanda (M.S.)

#### Teaching actvities

- 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

**On Weak-Space Complexity over Complex Numbers**Authors: Pushkar Joglekar, Pune, Raghavendra Rao B V, Siddhartha Sivakumar

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**On Hard Instances of Non-Commutative Permanent**Authors: Raghavendra Rao B V, Christian Engels

22nd International Computing and Combinatorics Conference (COCOON 2016), Aug 2016**Parameterized Analogues of Probabilistic Computation**Authors: Ankit Chauhan, Raghavendra Rao B V

Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2015), Feb 2015**Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems**Authors: Karl Bringmann, Christian Engels, Bodo Manthey, Raghavendra Rao B V

Algorithmica, (To Appear), Dec 2014**Building above read-once polynomials: identity testing and hardness of representation.**Authors: Meena Mahajan, Raghavendra Rao B V, Karteek Sreenivasaiah

The 20th Annual International Computing and Combinatorics Conference COCOON, 4-6 Aug 2014, Atlanta, USA., Aug 2014**Complexity of Testing Reachability in Matroids**Authors: Raghavendra Rao B V, Jayalal Sarma

Chicago Journal of Theoretical Computer Science, Vol 2014, No.5, Jul 2014