Prasad Raghavendra

Artificial Intelligence · 2006–2010

A researcher in the Science corpus: 4 papers; trusts 18 researchers and is trusted by 23 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 18 citations into it; #13,003 of 35,345 by trust here, #19,439 by citations
• Computational Theory and Mathematics — 18 citations into it; #1,209 of 12,182 by trust here, #2,851 by citations
• Statistical Learning Theory — 7 citations into it

Whom Prasad Raghavendra trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Subhash Khot
2. J. Håstad
3. Elchanan Mossel
4. Michel X. Goemans
5. Michael Kearns
6. Sanjeev Arora
7. Nick Littlestone
8. Nisheeth K. Vishnoi
9. David P. Williamson
10. Leslie G. Valiant

Who trusts Prasad Raghavendra overall

1. Elchanan Mossel
2. Xixuan Feng
3. Joe Neeman
4. Amit Daniely
5. David Steurer
6. Gilles Pisier
7. Vitaly Feldman
8. Arun Kumar
9. Subhash Khot
10. Adam R. Klivans

Papers from Prasad Raghavendra's perspective

Ordered by how strongly the researchers Prasad Raghavendra trusts endorse each paper. Same corpus, a different order for every researcher.

1. On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
2. The Strength of Weak Learnability
3. Some optimal inapproximability results
4. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
5. Learning in the presence of malicious errors
6. Efficient noise-tolerant learning from statistical queries
7. Noise Stability of Functions with Low Influences: Invariance and Optimality II - The Non Reversible Case
8. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ (IEEE Annual Symposium on Foundations of Computer Science)
9. Proof verification and hardness of approximation problems
10. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Their papers

• Hardness of Learning Halfspaces with Noise (2006) — 200 citations
• Optimal algorithms and inapproximability results for every CSP? (2008) — 497 citations
• Graph expansion and the unique games conjecture (2010) — 298 citations
• Agnostic Learning of Monomials by Halfspaces Is Hard (2009) — 165 citations