B. V. Raghavendra Rao

68 papers A 2B 10C 1Misc 9Journal 41Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bounds for packing chromatic number of some subclasses of trees.
Discuss. Math. Graph Theory
K. Mohamed Harith, A. V. Jayanthan, B. V. Raghavendra Rao
2025 J jnl
Algebraic and Combinatorial Algorithms for S-Packing Coloring.
ACM Commun. Comput. Algebra
K. Mohamed Harith, A. V. Jayanthan, B. V. Raghavendra Rao
2024 J jnl
Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions.
Discret. Math.
Arunkumar Ganesan, Narayanan Narayanan, B. V. Raghavendra Rao, Sagar S. Sawant
2023 J jnl
Parameterised Counting in Logspace.
Algorithmica
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2022 J jnl
Isomorphism testing of read-once functions and polynomials.
Inf. Comput.
B. V. Raghavendra Rao, Jayalal Sarma
2021 Misc conf
Limitations of Sums of Bounded Read Formulas and ABPs.
CSR
Purnata Ghosal, B. V. Raghavendra Rao
2021 A conf
Parameterised Counting in Logspace.
STACS
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2020 J jnl
Limitations of Sums of Bounded-Read Formulas.
CoRR
Purnata Ghosal, B. V. Raghavendra Rao
2020 J jnl
Lower bounds for special cases of syntactic multilinear ABPs.
Theor. Comput. Sci.
C. Ramya, B. V. Raghavendra Rao
2020 Misc conf
On Measures of Space over Real and Complex Numbers.
COCOON
Om Prakash, B. V. Raghavendra Rao
2020 J jnl
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.
Fundam. Informaticae
Purnata Ghosal, B. V. Raghavendra Rao
2020 J jnl
On hard instances of non-commutative permanent.
Discret. Appl. Math.
Christian Engels, B. V. Raghavendra Rao
2019 J jnl
A note on parameterized polynomial identity testing using hitting set generators.
Inf. Process. Lett.
Purnata Ghosal, B. V. Raghavendra Rao
2019 J jnl
Linear projections of the Vandermonde polynomial.
Theor. Comput. Sci.
C. Ramya, B. V. Raghavendra Rao
2019 B conf
Lower Bounds for Multilinear Order-Restricted ABPs.
MFCS
C. Ramya, B. V. Raghavendra Rao
2019 J jnl
Lower bounds for Sum and Sum of Products of Read-once Formulas.
ACM Trans. Comput. Theory
C. Ramya, B. V. Raghavendra Rao
2019 J jnl
Lower bounds for multilinear bounded order ABPs.
CoRR
C. Ramya, B. V. Raghavendra Rao
2019 Misc conf
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.
COCOON
Purnata Ghosal, B. V. Raghavendra Rao
2019 J jnl
Parameterised Counting Classes with Bounded Nondeterminism.
CoRR
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2018 Misc conf
Lower Bounds for Special Cases of Syntactic Multilinear ABPs.
COCOON
C. Ramya, B. V. Raghavendra Rao
2018 J jnl
Lower Bounds for Special Cases of Syntactic Multilinear ABPs.
CoRR
C. Ramya, B. V. Raghavendra Rao
2017 J jnl
Linear Projections of the Vandermonde Polynomial.
CoRR
C. Ramya, B. V. Raghavendra Rao
2017 J jnl
Linear Projections of the Vandermonde Polynomial.
Electron. Colloquium Comput. Complex.
C. Ramya, B. V. Raghavendra Rao
2017 Misc conf
On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction.
COCOON
Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao
2017 B conf
On Weak-Space Complexity over Complex Numbers.
FCT
Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar
2017 J jnl
On Weak-Space Complexity over Complex Numbers.
Electron. Colloquium Comput. Complex.
Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar
2017 B conf
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.
FCT
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2017 B conf
Testing Polynomial Equivalence by Scaling Matrices.
FCT
Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma
2016 J jnl
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.
Algorithmica
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2016 J jnl
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.
Electron. Colloquium Comput. Complex.
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2016 Misc conf
On Hard Instances of Non-Commutative Permanent.
COCOON
Christian Engels, B. V. Raghavendra Rao
2016 — conf
Sum of Products of Read-Once Formulas.
FSTTCS
Ramya C., B. V. Raghavendra Rao
2015 J jnl
Building above read-once polynomials: identity testing and hardness of representation.
Electron. Colloquium Comput. Complex.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2015 J jnl
Limitations of sum of products of Read-Once Polynomials.
CoRR
C. Ramya, B. V. Raghavendra Rao
2015 J jnl
Limitations of sum of products of Read-Once Polynomials.
Electron. Colloquium Comput. Complex.
C. Ramya, B. V. Raghavendra Rao
2015 — conf
Parameterized Analogues of Probabilistic Computation.
CALDAM
Ankit Chauhan, B. V. Raghavendra Rao
2015 J jnl
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.
Algorithmica
Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2014 Misc conf
Building above Read-once Polynomials: Identity Testing and Hardness of Representation.
COCOON
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2014 J jnl
Complexity of Testing Reachability in Matroids.
Chic. J. Theor. Comput. Sci.
B. V. Raghavendra Rao, Jayalal Sarma
2014 J jnl
Monomials, multilinearity and identity testing in simple read-restricted circuits.
Theor. Comput. Sci.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2014 J jnl
New Algorithms and Hard Instances for Non-Commutative Computation.
CoRR
Christian Engels, B. V. Raghavendra Rao
2014 J jnl
Parameterized Analogues of Probabilistic Computation.
CoRR
Ankit Chauhan, B. V. Raghavendra Rao
2013 J jnl
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.
CoRR
Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2013 B conf
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems.
MFCS
Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2013 J jnl
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits.
Comput. Complex.
Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao
2013 J jnl
Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas.
Comput. Complex.
Meena Mahajan, B. V. Raghavendra Rao
2013 J jnl
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.
Algorithmica
Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
2012 — conf
A Probabilistic Analysis of Christofides' Algorithm.
SWAT
Markus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao
2012 J jnl
Counting classes and the fine structure between NC
Theor. Comput. Sci.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2012 J jnl
Faster algorithms for finding and counting subgraphs.
J. Comput. Syst. Sci.
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
2012 B conf
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.
MFCS
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2012 C conf
Random Shortest Path Metrics with Applications.
CTW
Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2011 — conf
Isomorphism testing of read-once functions and polynomials.
FSTTCS
B. V. Raghavendra Rao, Jayalal Sarma
2011 J jnl
On the Complexity of Matroid Isomorphism Problem.
Theory Comput. Syst.
B. V. Raghavendra Rao, Jayalal Sarma
2011 B conf
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.
WADS
Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
2010 J jnl
Arithmetizing Classes Around NC\textsf{NC}
Theory Comput. Syst.
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2010 B conf
Counting Classes and the Fine Structure between NC
MFCS
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2010 J jnl
Counting Classes and the Fine Structure between NC
Electron. Colloquium Comput. Complex.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2009 J jnl
Faster Algorithms for Finding and Counting Subgraphs
CoRR
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh
2009 Misc conf
On the Complexity of Matroid Isomorphism Problems.
CSR
B. V. Raghavendra Rao, Jayalal Sarma
2009 Misc conf
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity.
CSR
Maurice J. Jansen, B. V. Raghavendra Rao
2009 — conf
Small space analogues of Valiant's classes and the limitations of skew formula.
Algebraic Methods in Computational Complexity
Meena Mahajan, B. V. Raghavendra Rao
2009 B conf
Small-Space Analogues of Valiant's Classes.
FCT
Meena Mahajan, B. V. Raghavendra Rao
2008 B conf
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae.
MFCS
Meena Mahajan, B. V. Raghavendra Rao
2008 J jnl
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae.
Electron. Colloquium Comput. Complex.
Meena Mahajan, B. V. Raghavendra Rao
2008 J jnl
On the Complexity of Matroid Isomorphism Problem
CoRR
B. V. Raghavendra Rao, Jayalal Sarma
2007 A conf
Arithmetizing Classes Around NC
STACS
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao
2007 J jnl
Arithmetizing classes around NC^1 and L.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao