Research Publications/Reports
Listing last 25 publications. (View All) View/Hide Filter- Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions
G Arun Kumar, Narayanan N., Raghavendra Rao B V, Sagar S. Sawant, Appeared in Discrete Mathematics, Vol 347, No.11, pp.114-162, Nov 2024.
- Parameterised Counting in Logspace
Anselm Haak, Arne Meier, Om Prakash, Raghavendra Rao B V, Appeared in Algorithmica, Vol 85, No.10, pp.2923--2961, Oct 2023. A preliminary version appeared in The 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Mar 2021.
- Isomorphism Testing of Read-once Functions and Polynomials
Raghavendra Rao B V, Jayalal Sarma, Appeared in Information and Computation, Feb 2022. A preliminary version 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.
- Limitations of Sums of Bounded Read Formulas and ABPs
Purnata Ghosal, Raghavendra Rao B V, Appeared in The 16th International Computer Science Symposium in Russia (CSR 2021), Jun 2021.
- On Measures of Space Over Real and Complex numbers
Om Prakash, Raghavendra Rao B V, Appeared in The 26th International Conference on Computing and Combinatorics (COCOON 2020), Aug 2020.
- Lower Bounds for Multilinear Order-restricted ABPs
Ramya C., Raghavendra Rao B V, Appeared in 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Sep 2019.
- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
Purnata Ghosal, Raghavendra Rao B V, Appeared in 25th International Computing and Combinatorics Conference, COCOON 2019, Aug 2019.
- Linear projections of the Vandermonde polynomial
Ramya C., Raghavendra Rao B V, Appeared in TCS, Theoretical Computer Science, Jul 2019.
- Lower bounds for Sum and Sum of Products of Read-once Formulas
Ramya C., Raghavendra Rao B V, Appeared in ToCT, ACM Transactions on Computation Theory, Vol 11, No.2, pp.10:1-10:27, May 2019. A preliminary version under the title "Sum of products of Read-Once Polynomials" appeared in 36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016.
- Lower Bounds for Special Classes of Syntactic Multilinear ABPs
Ramya C., Raghavendra Rao B V, Appeared in The 24th International Computing and Combinatorics Conference (COCOON 2018), Jul 2018.
- On Weak-Space Complexity over Complex Numbers
Pushkar Joglekar, Siddhartha Sivakumar, Raghavendra Rao B V, Appeared 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, Appeared 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, Appeared 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.
- 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.