Publications by the members of CSE Department :

Filters Type : Member : Area : Lab:

- Lower bounds for special cases of syntactic multilinear ABPs.

- Lower Bounds for Multilinear Order-Restricted ABPs.

Ramya C, B. V. Raghavendra Rao

Appeared in*44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. (MFCS 2019)*, LIPIcs, Vol 138, pp.52:1-52:14, Aug 2019. - On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.

Purnata Ghosal, B. V. Raghavendra Rao

Appeared in*Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings (COCOON 2019)*, Lecture Notes in Computer Science, Vol 11653, pp.178-192, Jul 2019. - Linear projections of the Vandermonde polynomial.

- A note on parameterized polynomial identity testing using hitting set generators.

- Lower bounds for Sum and Sum of Products of Read-once Formulas.

- Lower Bounds for Special Cases of Syntactic Multilinear ABPs.

Ramya C, B. V. Raghavendra Rao

Appeared in*Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings (COCOON 2018)*, Lecture Notes in Computer Science, Vol 10976, pp.701-712, Jul 2018. - On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.

Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Appeared in*Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017)*, Lecture Notes in Computer Science, Vol 10472, pp.230-242, Sep 2017. - On Weak-Space Complexity over Complex Numbers.

Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar

Appeared in*Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017)*, Lecture Notes in Computer Science, Vol 10472, pp.298-311, Sep 2017. - Testing Polynomial Equivalence by Scaling Matrices.

Markus Blser, B. V. Raghavendra Rao, Jayalal Sarma

Appeared in*Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017)*, Lecture Notes in Computer Science, Vol 10472, pp.111-122, Sep 2017. - On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction.

Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao

Appeared in*Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings (COCOON 2017)*, Lecture Notes in Computer Science, Vol 10392, pp.250-261, Aug 2017. - Sum of Products of Read-Once Formulas.

Ramya C., B. V. Raghavendra Rao

Appeared in*36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India (FSTTCS 2016)*, LIPIcs, Vol 65, pp.39:1-39:15, Dec 2016. - On Hard Instances of Non-Commutative Permanent.

Christian Engels, B. V. Raghavendra Rao

Appeared in*Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings (COCOON 2016)*, Lecture Notes in Computer Science, Vol 9797, pp.171-181, Aug 2016. - Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Appeared in*Algorithmica*, Vol 76, pp.890-909, 2016. - Parameterized Analogues of Probabilistic Computation.

Ankit Chauhan, B. V. Raghavendra Rao

Appeared in*Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings (CALDAM 2015)*, Lecture Notes in Computer Science, Vol 8959, pp.181-192, Feb 2015. - Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.

Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao

Appeared in*Algorithmica*, Vol 73, pp.42-62, 2015. - Complexity of Testing Reachability in Matroids.

- Building above Read-once Polynomials: Identity Testing and Hardness of Representation.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Appeared in*Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings (COCOON 2014)*, Lecture Notes in Computer Science, Vol 8591, pp.1-12, Aug 2014. - Monomials, multilinearity and identity testing in simple read-restricted circuits.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Appeared in*Theor. Comput. Sci.*, Vol 524, pp.90-102, 2014. - Complexity of Testing Reachability in Matroids.

- Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems.

Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao

Appeared in*Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (MFCS 2013)*, Lecture Notes in Computer Science, Vol 8087, pp.219-230, Aug 2013. - Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.

Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao

Appeared in*Computational Complexity*, Vol 22, pp.517-564, 2013. - Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas.

- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.

Markus Blser, Bodo Manthey, B. V. Raghavendra Rao

Appeared in*Algorithmica*, Vol 66, pp.397-418, 2013. - Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Appeared in*Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings (MFCS 2012)*, Lecture Notes in Computer Science, Vol 7464, pp.655-667, Aug 2012. - Isomorphism testing of read-once functions and polynomials.

B. V. Raghavendra Rao, Jayalal Sarma

Appeared in*IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India (FSTTCS 2011)*, LIPIcs, Vol 13, pp.115-126, Dec 2011. - On the Complexity of Matroid Isomorphism Problem.

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras