Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web D Karger, E Lehman, T Leighton, M Levine, D Lewin, R Panigrahy STOC 97, 654-663, 1997 | 2607 | 1997 |

Design tradeoffs for SSD performance. N Agrawal, V Prabhakaran, T Wobber, JD Davis, MS Manasse, ... USENIX Annual Technical Conference 57, 2008 | 1279 | 2008 |

Spamming botnets: signatures and characteristics Y Xie, F Yu, K Achan, R Panigrahy, G Hulten, I Osipkov ACM SIGCOMM Computer Communication Review 38 (4), 171-182, 2008 | 485 | 2008 |

Achieving anonymity via clustering G Aggarwal, R Panigrahy, T Feder, D Thomas, K Kenthapadi, S Khuller, ... ACM Transactions on Algorithms (TALG) 6 (3), 49, 2010 | 460 | 2010 |

Anonymizing tables G Aggarwal, T Feder, K Kenthapadi, R Motwani, R Panigrahy, D Thomas, ... International Conference on Database Theory, 246-258, 2005 | 395 | 2005 |

An improved construction for counting bloom filters F Bonomi, M Mitzenmacher, R Panigrahy, S Singh, G Varghese European Symposium on Algorithms, 684-695, 2006 | 337 | 2006 |

Better streaming algorithms for clustering problems M Charikar, L O'Callaghan, R Panigrahy Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 320 | 2003 |

The smallest grammar problem M Charikar, E Lehman, D Liu, R Panigrahy, M Prabhakaran, A Sahai, ... IEEE Transactions on Information Theory 51 (7), 2554-2576, 2005 | 315 | 2005 |

Approximation algorithms for k-anonymity G Aggarwal, T Feder, K Kenthapadi, R Motwani, R Panigrahy, D Thomas, ... Journal of Privacy Technology (JOPT), 2005 | 284 | 2005 |

Entropy based nearest neighbor search in high dimensions R Panigrahy Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 250 | 2006 |

Social network recommended content and recommending members for personalized search results T Harrington, R Shenoy, M Najork, R Panigrahy US Patent 8,949,232, 2015 | 190 | 2015 |

Estimating pagerank on graph streams AD Sarma, S Gollapudi, R Panigrahy Journal of the ACM (JACM) 58 (3), 13, 2011 | 171 | 2011 |

Heuristics for vector bin packing R Panigrahy, K Talwar, L Uyeda, U Wieder research. microsoft. com, 2011 | 168 | 2011 |

Approximate algorithms for k-anonymity H Park, K Shim Proceedings of the 2007 ACM SIGMOD international conference on Management of …, 2007 | 166 | 2007 |

Method and apparatus for distributing requests among a plurality of resources D Karger, E Lehman, FT Leighton, M Levine, D Lewin, R Panagrahy US Patent 6,430,618, 2002 | 135 | 2002 |

Validating heuristics for virtual machines consolidation S Lee, R Panigrahy, V Prabhakaran, V Ramasubramanian, K Talwar, ... Microsoft Research, MSR-TR-2011-9, 1-14, 2011 | 134 | 2011 |

A sketch-based distance oracle for web-scale graphs A Das Sarma, S Gollapudi, M Najork, R Panigrahy Proceedings of the third ACM international conference on Web search and data …, 2010 | 130 | 2010 |

Reducing TCAM power consumption and increasing throughput R Panigrahy, S Sharma Proceedings 10th Symposium on High Performance Interconnects, 107-112, 2002 | 128 | 2002 |

Lower bounds on locality sensitive hashing R Motwani, A Naor, R Panigrahi Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 119 | 2006 |

Clustering to minimize the sum of cluster diameters M Charikar, R Panigrahy Journal of Computer and System Sciences 68 (2), 417-441, 2004 | 104 | 2004 |