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.

Complexity Theory, Algebraic Complexity Theory, Combinatorial Commutative Algebra |

#### Current Students

##### See here for former students

- Om Prakash (Ph.D.)

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

- Probabilistic and Smoothed Analysis of Algorithms - Jan-Apr, 2023
- Mathematical Tools for Theoretical Computer Science - Jul-Nov, 2022
- Computability and Complexity - Jul-Nov, 2022
- Pseudorandomness - Jan-Apr, 2022
- Mathematical Tools for Theoretical Computer Science - Aug-Nov, 2021
- Topics in Design and Analysis of Algorithms - Feb-May, 2021
- Advanced Data Structures and Algorithms - Aug-Dec, 2020
- Topics in Complexity Theory - Jan-Apr, 2020
- Topics in Algorithmic Combinatorics and Graph Theory - Jan-Apr, 2020
- 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

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

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

**Isomorphism Testing of Read-once Functions and Polynomials**Authors: Raghavendra Rao B V, Jayalal Sarma

Information and Computation, Feb 2022**Limitations of Sums of Bounded Read Formulas and ABPs**Authors: Purnata Ghosal, Raghavendra Rao B V

The 16th International Computer Science Symposium in Russia (CSR 2021), Jun 2021**Parameterised Counting in Logspace**Authors: Anselm Haak, Arne Meier, Om Prakash, Raghavendra Rao B V

The 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Mar 2021**On Measures of Space Over Real and Complex numbers**Authors: Om Prakash, Raghavendra Rao B V

The 26th International Conference on Computing and Combinatorics (COCOON 2020), Aug 2020**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