Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
B. V. Raghavendra Rao
2010 – today
- 2013
[j6]Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao: Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Algorithmica 66(2): 397-418 (2013)- [j5]Meena Mahajan, B. V. Raghavendra Rao: Small Space Analogues of Valiant's Classes and the Limitations of Skew Formulas. Computational Complexity 22(1): 1-38 (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 M. N. Sarma: On the Complexity of Matroid Isomorphism Problem. Theory Comput. Syst. 49(2): 246-272 (2011)
- [c8]B. V. Raghavendra Rao, Jayalal M. N. 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
- [i5]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. Electronic Colloquium on Computational Complexity (ECCC) 17: 101 (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 M. N. Sarma: On the Complexity of Matroid Isomorphism Problems. CSR 2009: 286-298
- [c3]
- [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 M. N. 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. Electronic Colloquium on Computational Complexity (ECCC) 15(048) (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. Electronic Colloquium on Computational Complexity (ECCC) 14(087) (2007)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:52 CEST by the dblp team