B. V. Raghavendra Rao

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 30

Top Topics

Space Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

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