Satish Rao

Artificial Intelligence · 2003–2010

A researcher in the Science corpus: 6 papers; trusts 12 researchers and is trusted by 36 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 32 citations into it; #7,244 of 35,345 by trust here, #5,495 by citations
• Computer Networks and Communications — 25 citations into it; #2,838 of 9,886 by trust here, #671 by citations
• Safety, Robustness & Interpretability — 15 citations into it; #886 of 2,251 by trust here, #474 by citations
• Computer Graphics and Computer-Aided Design — 11 citations into it
• Statistics and Probability — 11 citations into it; #2,761 of 12,932 by trust here, #3,330 by citations
• Applied Mathematics — 6 citations into it
• Computational Theory and Mathematics — 5 citations into it; #1,427 of 12,182 by trust here, #1,782 by citations

Whom Satish Rao trusts overall

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

1. Yurii E. Nesterov
2. L. Lov'asz
3. Naveen Garg
4. N. Linial
5. Santosh Srinivas Vempala
6. Anukool Lakhina
7. Jirí Matousek
8. Robert L. Smith
9. Keith Ball

Who trusts Satish Rao overall

1. David P. Williamson
2. Subhash Khot
3. Sanjeev Arora
4. Harald Räcke
5. Andreas Noack
6. Jure Leskovec
7. Battista Biggio
8. Prasad Raghavendra
9. David B. Shmoys
10. Blake Shaw

Papers from Satish Rao's perspective

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

1. Adversarial learning
2. Probabilistic approximation of metric spaces and its algorithmic applications
3. Diagnosing network-wide traffic anomalies
4. Hit-and-run from a corner
5. Adversarial classification
6. The geometry of graphs and some of its algorithmic applications
7. On Attacking Statistical Spam Filters
8. Anomalous Payload-Based Network Intrusion Detection
9. Polygraph: automatically generating signatures for polymorphic worms
10. Characterization of network-wide anomalies in traffic flows (ACM/SIGCOMM Internet Measurement Conference)

Their papers

• Expander flows, geometric embeddings and graph partitioning (2004) — 674 citations
• ANTIDOTE: understanding and defending against poisoning of anomaly detectors (2009) — 428 citations
• A tight bound on approximating arbitrary metrics by tree metrics (2003) — 1,006 citations
• Near-Optimal Evasion of Convex-Inducing Classifiers (2010) — 55 citations
• Query Strategies for Evading Convex-Inducing Classifiers (2010) — 123 citations
• Stealthy poisoning attacks on PCA-based anomaly detectors (2009) — 66 citations