#### Research Publications/Reports

Listing last 25 publications. (View All) View/Hide Filter**On Weak-Space Complexity over Complex Numbers**Pushkar Joglekar, Siddhartha Sivakumar, Raghavendra Rao B V, To Appear in

*21st International Symposium on Fundamentals of Computation Theory (FCT 2017)*, Sep 2017.**On depth five Sum-Power-Sum-Power-Sum Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree**Christian Engels, Raghavendra Rao B V, Karteek Sreenivasaiah, To Appear in

*21st International Symposium on Fundamentals of Computation Theory (FCT 2017)*, Sep 2017.**Testing Equivalence of Polynomials under Scaling**Markus Blaser, Raghavendra Rao B V, Jayalal Sarma, To Appear in

*21st International Symposium on Fundamentals of Computation Theory (FCT)*, Sep 2017.**On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction**Purnata Ghosal, Om Prakash, Raghavendra Rao B V, Appeared in

*23rd Annual International Computing and Combinatorics Conference (COCOON 2017)*, Aug 2017.**Sum of products of Read-Once Polynomials**Ramya C., Raghavendra Rao B V, Appeared in

*36th International Conference on Foundations of Software Technology and Theoretical Computer Science*, Dec 2016.**On Hard Instances of Non-Commutative Permanent**Raghavendra Rao B V, Christian Engels, Appeared in

*22nd International Computing and Combinatorics Conference (COCOON 2016)*, Aug 2016.**Parameterized Analogues of Probabilistic Computation**Ankit Chauhan, Raghavendra Rao B V, Appeared in

*Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2015)*, Feb 2015.**Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems**Karl Bringmann, Christian Engels, Bodo Manthey, Raghavendra Rao B V, Appeared in

*Algorithmica*, (To Appear), Dec 2014. A preliminary version appeared in 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2013.**Building above read-once polynomials: identity testing and hardness of representation.**Meena Mahajan, Raghavendra Rao B V, Karteek Sreenivasaiah, Appeared in

*The 20th Annual International Computing and Combinatorics Conference COCOON, 4-6 Aug 2014, Atlanta, USA.*, Aug 2014.**Complexity of Testing Reachability in Matroids**Raghavendra Rao B V, Jayalal Sarma, Appeared in

*Chicago Journal of Theoretical Computer Science*, Vol 2014, No.5, Jul 2014.**Monomials, multilinearity and identity testing in simple read-restricted circuits**Meena Mahajan, Raghavendra Rao B V, Karteek Sreenivasaiah, Appeared in

*Theoretical Computer Science*, 2014. A preliminary version under the title "Monomials in read once/twice formulas and branching programs" appeared in Mathematical Foundations of Computer Science (MFCS), 2012.**Small space analogues of Valiants classes**Meena Mahajan, Raghavendra Rao B V, Appeared in

*Computational Complexity*, Jul 2013. A preliminary version appeared in Foundations of Computation Theory, FCT, Jul 2009.**Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals**Markus Blaeser, Bodo Manthey, Raghavendra Rao B V, Appeared in

*Algorithmica*, Vol 66, No.2, pp.397-418, Jul 2013. A preliminary version appeared in WADS Symposium, Jul 2011.**Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits**Maurice Jansen, Meena Mahajan, Raghavendra Rao B V, Appeared in

*Computational Complexity*, Jul 2013. A preliminary version under the title "Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae" appeared in Mathematical Foundations of Computer Science (MFCS), MFCS, Jul 2008.**Probabilistic Analysis of Christofides Algorithm.**Markus Blaeser, Konstantinos Panagiotou, Raghavendra Rao B V, Appeared in

*Scandinavian Symposium on Algorithm Theory (SWAT)*, SWAT, Jul 2012.**Faster Algorithms for Finding and Counting Subgraphs.**Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Raghavendra Rao B V, Saket Saurabh, Appeared in

*Journal of Computer and System Sciences*, Vol 78, pp.698-706, Jul 2012.**Counting classes and the fine structure between NC^1 and L**Samir Datta, Meena Mahajan, Raghavendra Rao B V, Michael Thomas, Heribert Vollmer, Appeared in

*Theoretical Computer Science*, TCS, Vol 417, pp.36-49, Jul 2012. A preliminary version under the title "Counting Classes and the Fine Structure between NC^1 and L" appeared in Mathematical Foundations of Computer Science (MFCS), MFCS, Jul 2010.**Isomorphism Testing of Read-once Functions and Polynomials**Raghavendra Rao B V, Jayalal Sarma, Appeared in

*Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)*, LIPIcs–Leibniz International Proceedings in Informatics, Vol 13, pp.115-126, Dec 2011.**On the Complexity of Matroid Isomorphism Problem**Raghavendra Rao B V, Jayalal Sarma, Appeared in

*Theory of Computing Systems*, Vol 49, No.2, pp.246-272, Aug 2011. A preliminary version appeared in Proceedings of the 4th Computer Science Symposium in Russia (CSR 2009), Vol 5675, pp.286-298, Aug 2009.**Arithmetizing Classes around NC1 and L**Meena Mahajan, Nutan Limaye, Raghavendra Rao B V, Appeared in

*Theory of Computing Systems*, Vol 46, No.3, pp.499-522, Jul 2010. A preliminary version appeared in Symposium on Theoretical Aspects of Computer Science, STACS, Mar 2007.**Simulation of Arithmetical Circuits by Branching Programs Preserving Constant Width and Syntactic Multilinearity**Maurice Jansen, Raghavendra Rao B V, Appeared in

*Symposium on Computer Science in Russia (CSR)*, CSR, Jul 2009.