default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. V. Raghavendra Rao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]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): 114162 (2024)- 2023
- [j19]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. Algorithmica 85(10): 2923-2961 (2023) - 2022
- [j18]B. V. Raghavendra Rao, Jayalal Sarma:
Isomorphism testing of read-once functions and polynomials. Inf. Comput. 285(Part): 104921 (2022) - 2021
- [c26]Purnata Ghosal, B. V. Raghavendra Rao:
Limitations of Sums of Bounded Read Formulas and ABPs. CSR 2021: 147-169 - [c25]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. STACS 2021: 40:1-40:17 - 2020
- [j17]Christian Engels, B. V. Raghavendra Rao:
On hard instances of non-commutative permanent. Discret. Appl. Math. 277: 127-138 (2020) - [j16]Purnata Ghosal, B. V. Raghavendra Rao:
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models. Fundam. Informaticae 177(1): 69-93 (2020) - [j15]C. Ramya, B. V. Raghavendra Rao:
Lower bounds for special cases of syntactic multilinear ABPs. Theor. Comput. Sci. 809: 1-20 (2020) - [c24]Om Prakash, B. V. Raghavendra Rao:
On Measures of Space over Real and Complex Numbers. COCOON 2020: 508-519 - [i20]Purnata Ghosal, B. V. Raghavendra Rao:
Limitations of Sums of Bounded-Read Formulas. CoRR abs/2010.01385 (2020)
2010 – 2019
- 2019
- [j14]Purnata Ghosal, B. V. Raghavendra Rao:
A note on parameterized polynomial identity testing using hitting set generators. Inf. Process. Lett. 151 (2019) - [j13]C. Ramya, B. V. Raghavendra Rao:
Linear projections of the Vandermonde polynomial. Theor. Comput. Sci. 795: 165-182 (2019) - [j12]C. Ramya, B. V. Raghavendra Rao:
Lower bounds for Sum and Sum of Products of Read-once Formulas. ACM Trans. Comput. Theory 11(2): 10:1-10:27 (2019) - [c23]Purnata Ghosal, B. V. Raghavendra Rao:
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models. COCOON 2019: 178-192 - [c22]C. Ramya, B. V. Raghavendra Rao:
Lower Bounds for Multilinear Order-Restricted ABPs. MFCS 2019: 52:1-52:14 - [i19]C. Ramya, B. V. Raghavendra Rao:
Lower bounds for multilinear bounded order ABPs. CoRR abs/1901.04377 (2019) - [i18]Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting Classes with Bounded Nondeterminism. CoRR abs/1904.12156 (2019) - 2018
- [c21]C. Ramya, B. V. Raghavendra Rao:
Lower Bounds for Special Cases of Syntactic Multilinear ABPs. COCOON 2018: 701-712 - [i17]C. Ramya, B. V. Raghavendra Rao:
Lower Bounds for Special Cases of Syntactic Multilinear ABPs. CoRR abs/1804.08810 (2018) - 2017
- [c20]Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao:
On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction. COCOON 2017: 250-261 - [c19]Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma:
Testing Polynomial Equivalence by Scaling Matrices. FCT 2017: 111-122 - [c18]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: 230-242 - [c17]Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar:
On Weak-Space Complexity over Complex Numbers. FCT 2017: 298-311 - [i16]C. Ramya, B. V. Raghavendra Rao:
Linear Projections of the Vandermonde Polynomial. CoRR abs/1705.03188 (2017) - [i15]Pushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar:
On Weak-Space Complexity over Complex Numbers. Electron. Colloquium Comput. Complex. TR17 (2017) - [i14]C. Ramya, B. V. Raghavendra Rao:
Linear Projections of the Vandermonde Polynomial. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j11]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica 76(4): 890-909 (2016) - [c16]Christian Engels, B. V. Raghavendra Rao:
On Hard Instances of Non-Commutative Permanent. COCOON 2016: 171-181 - [c15]Ramya C., B. V. Raghavendra Rao:
Sum of Products of Read-Once Formulas. FSTTCS 2016: 39:1-39:15 - [i13]Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j10]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica 73(1): 42-62 (2015) - [c14]Ankit Chauhan, B. V. Raghavendra Rao:
Parameterized Analogues of Probabilistic Computation. CALDAM 2015: 181-192 - [i12]C. Ramya, B. V. Raghavendra Rao:
Limitations of sum of products of Read-Once Polynomials. CoRR abs/1512.03607 (2015) - [i11]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above read-once polynomials: identity testing and hardness of representation. Electron. Colloquium Comput. Complex. TR15 (2015) - [i10]C. Ramya, B. V. Raghavendra Rao:
Limitations of sum of products of Read-Once Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j9]B. V. Raghavendra Rao, Jayalal Sarma:
Complexity of Testing Reachability in Matroids. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j8]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Monomials, multilinearity and identity testing in simple read-restricted circuits. Theor. Comput. Sci. 524: 90-102 (2014) - [c13]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. COCOON 2014: 1-12 - [i9]Christian Engels, B. V. Raghavendra Rao:
New Algorithms and Hard Instances for Non-Commutative Computation. CoRR abs/1409.0742 (2014) - [i8]Ankit Chauhan, B. V. Raghavendra Rao:
Parameterized Analogues of Probabilistic Computation. CoRR abs/1409.7790 (2014) - 2013
- [j7]Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao:
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Algorithmica 66(2): 397-418 (2013) - [j6]Meena Mahajan, B. V. Raghavendra Rao:
Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. Comput. Complex. 22(1): 1-38 (2013) - [j5]Maurice J. Jansen, Meena Mahajan, B. V. Raghavendra Rao:
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. Comput. Complex. 22(3): 517-564 (2013) - [c12]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. MFCS 2013: 219-230 - [i7]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. CoRR abs/1306.3030 (2013) - 2012
- [j4]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): 698-706 (2012) - [j3]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012) - [c11]Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Path Metrics with Applications. CTW 2012: 121-124 - [c10]Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. MFCS 2012: 655-667 - [c9]Markus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao:
A Probabilistic Analysis of Christofides' Algorithm. SWAT 2012: 225-236 - 2011
- [j2]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problem. Theory Comput. Syst. 49(2): 246-272 (2011) - [c8]B. V. Raghavendra Rao, Jayalal Sarma:
Isomorphism testing of read-once functions and polynomials. FSTTCS 2011: 115-126 - [c7]Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao:
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. WADS 2011: 110-121 - 2010
- [j1]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L}. Theory Comput. Syst. 46(3): 499-522 (2010) - [c6]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317 - [i6]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Maurice J. Jansen, B. V. Raghavendra Rao:
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. CSR 2009: 179-190 - [c4]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problems. CSR 2009: 286-298 - [c3]Meena Mahajan, B. V. Raghavendra Rao:
Small-Space Analogues of Valiant's Classes. FCT 2009: 250-261 - [i5]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 - [i4]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh:
Faster Algorithms for Finding and Counting Subgraphs. CoRR abs/0912.2371 (2009) - 2008
- [c2]Meena Mahajan, B. V. Raghavendra Rao:
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae. MFCS 2008: 455-466 - [i3]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problem. CoRR abs/0811.3859 (2008) - [i2]Meena Mahajan, B. V. Raghavendra Rao:
Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c1]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing Classes Around NC 1 and L. STACS 2007: 477-488 - [i1]Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao:
Arithmetizing classes around NC^1 and L. Electron. Colloquium Comput. Complex. TR07 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
