Prasad Raghavendra
Affiliations: | Electrical Engineering and Computer Science | University of California, Berkeley, Berkeley, CA, United States |
Area:
Theory (THY)Google:
"Prasad Raghavendra"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ghazi B, Kamath P, Raghavendra P. (2018) Dimension reduction for polynomials over gaussian space and applications Electronic Colloquium On Computational Complexity. 24: 125 |
| Lee JR, Raghavendra P, Steurer D. (2015) Lower bounds on the size of semidefinite programming relaxations Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 567-576 |
| Diakonikolas I, Raghavendra P, Servedio RA, et al. (2014) Average sensitivity and noise sensitivity of polynomial threshold functions Siam Journal On Computing. 43: 231-253 |
| Chen N, Engelberg R, Nguyen CT, et al. (2013) Improved approximation algorithms for the spanning star forest problem Algorithmica. 65: 498-516 |
| Bhattacharyya A, Grigorescu E, Raghavendra P, et al. (2012) Testing odd-cycle-freeness in boolean functions Combinatorics Probability and Computing. 21: 835-855 |
| Guruswami V, H̊Astad J, Manokaran R, et al. (2011) Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914 |
| Lee JR, Raghavendra P. (2010) Coarse differentiation and multi-flows in planar graphs Discrete and Computational Geometry. 43: 346-362 |
| Guruswami V, Manokaran R, Raghavendra P. (2008) Beating the random ordering is hard: inapproximability of maximum acyclic subgraph Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 573-582 |
| Guruswami V, Raghavendra P. (2006) Hardness of learning halfspaces with noise Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 543-552 |