BRB. V. Raghavendra Rao
B. V. Raghavendra Rao
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
B. V. Raghavendra Rao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Meena Mahajan
The Institute of Mathematical Sciences (CI of Homi Bhabha National Institute), Chennai, India
3 shared publications - Daniel Lokshtanov
Department of Informatics University of Bergen Norway
1 shared publication - Fedor V. Fomin
Department of Informatics, University of Bergen
1 shared publication - Jayalal Sarma M. N
Institute for Theoretical Computer Science Tsinghua University Beijing China
1 shared publication - Karteek Sreenivasaiah
The Institute of Mathematical Sciences, Chennai, India
1 shared publication - Maurice Jansen
Institute for Theoretical Computer Science, Tsinghua University, Beijing, China
1 shared publication
Latest Publications
- 1 March 2014
- Published by Elsevier in Theoretical Computer Science
- Vol. 524, 90-102
Monomials, multilinearity and identity testing in simple read-restricted circuits
- 1 March 2014
- Published by Elsevier in Theoretical Computer Science
- Vol. 524, 90-102
Monomials, multilinearity and identity testing in simple read-restricted circuits
- 18 June 2013
- Published by Springer Nature in computational complexity
- Vol. 22 (3) , 517-564
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
- 18 June 2013
- Published by Springer Nature in computational complexity
- Vol. 22 (3) , 517-564
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
- 20 October 2011
- Published by Springer Nature in computational complexity
- Vol. 22 (1) , 1-38
Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas
- 20 October 2011
- Published by Springer Nature in computational complexity
- Vol. 22 (1) , 1-38
Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas
- 20 October 2011
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 78 (3) , 698-706
Faster algorithms for finding and counting subgraphs
- 20 October 2011
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 78 (3) , 698-706
Faster algorithms for finding and counting subgraphs
- Open Access
- 13 April 2010
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (2) , 246-272
On the Complexity of Matroid Isomorphism Problem
- 13 April 2010
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (2) , 246-272
Open AccessOn the Complexity of Matroid Isomorphism Problem