Raghavendra Rao B V
Raghavendra Rao B V
Verified email at - Homepage
Cited by
Cited by
Faster algorithms for finding and counting subgraphs
FV Fomin, D Lokshtanov, V Raman, S Saurabh, BVR Rao
Journal of Computer and System Sciences 78 (3), 698-706, 2012
Regularity of binomial edge ideals of certain block graphs
AV Jayanthan, N Narayanan, BV Raghavendra Rao
Proceedings-Mathematical Sciences 129, 1-10, 2019
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
BVRR Markus Bläser, Bodo Manthey
WADS, 110-121, 2011
Small-space analogues of Valiant’s classes
M Mahajan, BVR Rao
International Symposium on Fundamentals of Computation Theory, 250-261, 2009
Arithmetizing Classes Around NC1 and L
N Limaye, M Mahajan, BVR Rao
Annual Symposium on Theoretical Aspects of Computer Science, 477-488, 2007
Simulation of arithmetical circuits by branching programs with preservation of constant width and syntactic multilinearity
M Jansen, R Rao BV
Computer Science-Theory and Applications: Fourth International Computer …, 2009
Random shortest paths: Non-euclidean instances for metric optimization problems
K Bringmann, C Engels, B Manthey, BVR Rao
Algorithmica 73, 42-62, 2015
Small space analogues of valiant’s classes and the limitations of skew formulas
M Mahajan, BV Raghavendra Rao
computational complexity 22 (1), 1-38, 2013
Parameterized analogues of probabilistic computation
A Chauhan, BVR Rao
Conference on Algorithms and Discrete Applied Mathematics, 181-192, 2015
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae
M Mahajan, BV Raghavendra Rao
Mathematical Foundations of Computer Science 2008: 33rd International …, 2008
An upper bound for the regularity of binomial edge ideals of trees
AV Jayanthan, N Narayanan, BV Rao
arXiv preprint arXiv:1808.06374, 2018
Isomorphism testing of read-once functions and polynomials
R Rao BV, J Sarma MN
IARCS Annual Conference on Foundations of Software Technology and …, 2011
Lower bounds for special cases of syntactic multilinear abps
C Ramya, BVR Rao
Theoretical Computer Science 809, 1-20, 2020
Building above read-once polynomials: Identity testing and hardness of representation
M Mahajan, BVR Rao, K Sreenivasaiah
Algorithmica 76, 890-909, 2016
On the complexity of matroid isomorphism problems
R Rao BV, J Sarma MN
International Computer Science Symposium in Russia, 286-298, 2009
Resource trade-offs in syntactically multilinear arithmetic circuits
M Jansen, M Mahajan, BVR Rao
computational complexity 22 (3), 517-564, 2013
Counting classes and the fine structure between NC1 and L
S Datta, M Mahajan, BVR Rao, M Thomas, H Vollmer
Theoretical Computer Science 417, 36-49, 2012
Monomials, multilinearity and identity testing in simple read-restricted circuits
M Mahajan, BVR Rao, K Sreenivasaiah
Theoretical Computer Science 524, 90-102, 2014
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs
M Mahajan, BVR Rao, K Sreenivasaiah
International Symposium on Mathematical Foundations of Computer Science, 655-667, 2012
On the Complexity of Matroid Isomorphism Problem.
BVR Rao, J Sarma
Theory Comput. Syst. 49 (2), 246-272, 2011
The system can't perform the operation now. Try again later.
Articles 1–20