☰

Prasad Raghavendra - Publications

Affiliations: 
Electrical Engineering and Computer Science University of California, Berkeley, Berkeley, CA, United States 
Area:
Theory (THY)
Tree Info Similar researchers PubMed Report error

9 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Ghazi B, Kamath P, Raghavendra P. Dimension reduction for polynomials over gaussian space and applications Electronic Colloquium On Computational Complexity. 24: 125. DOI: 10.4230/Lipics.Ccc.2018.28  0.339
2015 Lee JR, Raghavendra P, Steurer D. Lower bounds on the size of semidefinite programming relaxations Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 567-576. DOI: 10.1145/2746539.2746599  0.318
2014 Diakonikolas I, Raghavendra P, Servedio RA, Tan LY. Average sensitivity and noise sensitivity of polynomial threshold functions Siam Journal On Computing. 43: 231-253. DOI: 10.1137/110855223  0.315
2013 Chen N, Engelberg R, Nguyen CT, Raghavendra P, Rudra A, Singh G. Improved approximation algorithms for the spanning star forest problem Algorithmica. 65: 498-516. DOI: 10.1007/S00453-011-9607-1  0.342
2012 Bhattacharyya A, Grigorescu E, Raghavendra P, Shapira A. Testing odd-cycle-freeness in boolean functions Combinatorics Probability and Computing. 21: 835-855. DOI: 10.1017/S0963548312000363  0.337
2011 Guruswami V, H̊Astad J, Manokaran R, Raghavendra P, Charikar M. Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914. DOI: 10.1137/090756144  0.382
2010 Lee JR, Raghavendra P. Coarse differentiation and multi-flows in planar graphs Discrete and Computational Geometry. 43: 346-362. DOI: 10.1007/S00454-009-9172-4  0.33
2008 Guruswami V, Manokaran R, Raghavendra P. Beating the random ordering is hard: inapproximability of maximum acyclic subgraph Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 573-582. DOI: 10.1109/FOCS.2008.51  0.31
2006 Guruswami V, Raghavendra P. Hardness of learning halfspaces with noise Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 543-552. DOI: 10.1137/070685798  0.346
Show low-probability matches.