B. V. Raghavendra Rao

According to our database, B. V. Raghavendra Rao authored at least 45 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions.

Arunkumar Ganesan, Narayanan Narayanan, B. V. Raghavendra Rao, Sagar S. Sawant

Discret. Math., 2024

2023

Parameterised Counting in Logspace.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

Algorithmica, October, 2023

2022

Isomorphism testing of read-once functions and polynomials.

B. V. Raghavendra Rao, Jayalal Sarma

Inf. Comput., 2022

2021

Limitations of Sums of Bounded Read Formulas and ABPs.

Purnata Ghosal, B. V. Raghavendra Rao

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Lower bounds for special cases of syntactic multilinear ABPs.

C. Ramya, B. V. Raghavendra Rao

Theor. Comput. Sci., 2020

On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.

Purnata Ghosal, B. V. Raghavendra Rao

Fundam. Informaticae, 2020

On hard instances of non-commutative permanent.

Christian Engels, B. V. Raghavendra Rao

Discret. Appl. Math., 2020

Limitations of Sums of Bounded-Read Formulas.

Purnata Ghosal, B. V. Raghavendra Rao

CoRR, 2020

On Measures of Space over Real and Complex Numbers.

Om Prakash, B. V. Raghavendra Rao

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

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

C. Ramya, B. V. Raghavendra Rao

ACM Trans. Comput. Theory, 2019

Linear projections of the Vandermonde polynomial.

C. Ramya, B. V. Raghavendra Rao

Theor. Comput. Sci., 2019

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

Purnata Ghosal, B. V. Raghavendra Rao

Inf. Process. Lett., 2019

Parameterised Counting Classes with Bounded Nondeterminism.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

CoRR, 2019

Lower bounds for multilinear bounded order ABPs.

C. Ramya, B. V. Raghavendra Rao

CoRR, 2019

Lower Bounds for Multilinear Order-Restricted ABPs.

C. Ramya, B. V. Raghavendra Rao

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2017

On Weak-Space Complexity over Complex Numbers.

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

Electron. Colloquium Comput. Complex., 2017

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

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Testing Polynomial Equivalence by Scaling Matrices.

Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction.

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

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.

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

Electron. Colloquium Comput. Complex., 2016

Sum of Products of Read-Once Formulas.

Ramya C., B. V. Raghavendra Rao

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Limitations of sum of products of Read-Once Polynomials.

C. Ramya, B. V. Raghavendra Rao

Electron. Colloquium Comput. Complex., 2015

Building above read-once polynomials: identity testing and hardness of representation.

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

Electron. Colloquium Comput. Complex., 2015

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

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

Algorithmica, 2015

Parameterized Analogues of Probabilistic Computation.

Ankit Chauhan, B. V. Raghavendra Rao

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Monomials, multilinearity and identity testing in simple read-restricted circuits.

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

Theor. Comput. Sci., 2014

New Algorithms and Hard Instances for Non-Commutative Computation.

Christian Engels, B. V. Raghavendra Rao

CoRR, 2014

Complexity of Testing Reachability in Matroids.

B. V. Raghavendra Rao, Jayalal Sarma

Chic. J. Theor. Comput. Sci., 2014

2013

Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas.

Meena Mahajan, B. V. Raghavendra Rao

Comput. Complex., 2013

Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.

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

Comput. Complex., 2013

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.

Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao

Algorithmica, 2013

2012

Counting classes and the fine structure between NC¹ and L.

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer

Theor. Comput. Sci., 2012

Faster algorithms for finding and counting subgraphs.

Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao

J. Comput. Syst. Sci., 2012

A Probabilistic Analysis of Christofides' Algorithm.

Markus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.

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

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Random Shortest Path Metrics with Applications.

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

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

On the Complexity of Matroid Isomorphism Problem.

B. V. Raghavendra Rao, Jayalal Sarma

Theory Comput. Syst., 2011

2010

Arithmetizing Classes Around NC\textsf{NC}¹ and L\textsf{L}.

Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao

Theory Comput. Syst., 2010

2009

Small-Space Analogues of Valiant's Classes.

Meena Mahajan, B. V. Raghavendra Rao

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Small space analogues of Valiant's classes and the limitations of skew formula.

Meena Mahajan, B. V. Raghavendra Rao

Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

On the Complexity of Matroid Isomorphism Problems.

B. V. Raghavendra Rao, Jayalal Sarma

Proceedings of the Computer Science, 2009

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.

Maurice J. Jansen, B. V. Raghavendra Rao

Proceedings of the Computer Science, 2009

2008

Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae.

Meena Mahajan, B. V. Raghavendra Rao

Electron. Colloquium Comput. Complex., 2008

2007

Arithmetizing classes around NC^1 and L.

Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao

Electron. Colloquium Comput. Complex., 2007

Arithmetizing Classes Around NC ¹ and L.

Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao

Proceedings of the STACS 2007, 2007