Rina Panigrahy
RESEARCHER
.
I am a researcher at Microsoft Research in Mountain View since Feb 07. I have worked on several topics ranging from engineering problems such as fast regular expression for worm detection in networks, distributed caching for content delivery networks to complexity of algorithms such as high dimensional search, hashing, sketching and streaming. I am particularly interested in algorithmic issues that arise in practice. In the past I was at Stanford 2004-2006, Cisco Systems (Engineer): 1998-2006, MIT 1995-1997, and IIT Bombay 1991-1995.
Publications
- Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Sparse Cut Projections in Graph Streams, in 17th Annual European Symposium on Algorithms (ESA), European Association for Theoretical Computer Science, September 2009
- Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy, Less is More: Sampling the Neighborhood Graph Makes SALSA Better and Faster, in 2nd ACM International Conference on Web Search and Data Mining, Association for Computing Machinery, Inc., February 2009
- Eric Lehman and Rina Panigrahy, 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit, in ESA, 2009
- Andrew McGregor Krzysztof Onak and Rina Panigrahy, The Oil Searching Problem, in ESA, 2009
- Rina Panigrahy, Kunal Talwar, and Udi Wieder, A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match, in FOCS '08: Proceedings of the 49th annual IEEE Symposium on Foundations of Computer Science, IEEE, October 2008
- Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, and Ivan Osipkov, Spamming Botnet: Signatures and Characteristics, in ACM SIGCOMM 2008, Seattle, WA, August 2008
- Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Estimating PageRank on Graph Streams, in Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, Inc., June 2008
- Sreenivas Gollapudi and Rina Panigrahy, The power of two min-hashes in similarity search among hierarchical data objects, in Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, Inc., June 2008
- Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark Manasse, and Rina Panigrahy, Design Tradeoffs for SSD Performance, in Proceedings of the 2008 USENIX Technical Conference (USENIX'08), USENIX, June 2008
- Rina Panigrahy, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, in Latin American Symposium on Theoretical Informatics (LATIN), Springer, Búzios, Brazil, April 2008
- Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, and Udi Wieder, Trace reconstruction with constant deletion probability and related results, in ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, January 2008
- Rina Panigrahy, "Improved algorithms for Nearest neighbor search in high dimensions"., in LATIN 2008.[PPT ], 2008
- Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, Using Bloom Filters to Speed Up HITS-like Ranking Algorithms, in 5th Workshop on Algorithms and Models for the Web Graph (WAW), Springer-Verlag, December 2007
- Rina Panigrahy and Dilys Thomas, Finding Frequent Elements in non-bursty Streams, in Annual European Symposium on Algorithms (ESA), Eilat, Israel, October 2007
- Rina Panigrahy and Ravi Kumar, On Finding Frequent Elements in a Data Stream, in Workshop on Randomization and Computation (RANDOM), Princeton University, NJ, August 2007
- Rajeev Motwani, Rina Panigrahy, and Ying Xu 0002, Estimating Sum by Weighted Sampling, in International Colloquium on Automata, Languages and Programming, (ICALP), Wroclaw, Poland, July 2007
- Rina Panigrahy, "Hashing Searching Sketching", in Ph.D. Thesis, Stanford University., 2007
- Sreenivas Gollapdui and Rina Panigrahy, Exploiting asymmetry in hierarchical topic extraction, in Proc. ACM CIKM International Conference on Information and Knowledge Management, Association for Computing Machinery, Inc., 6 November 2006
- Sreenivas Gollapudi and Rina Panigrahy, A dictionary for approximate string search and longest prefix search, in Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Association for Computational Linguistics, November 2006
- Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, and An Zhu, Achieving Anonymity via Clustering, in PODS, Association for Computing Machinery, Inc., 2006
- Rajeev Motwani, Assaf Naor, and Rina Panigrahy, "Lower bounds on Locality Sensitive Hashing"., in SOCG 2006., 2006
- Rina Panigrahy, "Entropy based Nearest Neighbor Search in High Dimensions"., in SODA 2006., 2006
- Krishnaram Kenthapadi and Rina Panigrahy, Balanced Allocation on Graphs, in SODA (Student Best Paper Award), Association for Computing Machinery, Inc., 2006
- with Flavio Bonomi, Michael Mitzenmacher, Sushil Singh,, George Varghese, and Rina Panigrahy, "Compact Approximate Representations of Concurrent State Machines for Network Applications", in Proceedings of the ACM SIGCOMM Conference, Pisa, Italy, September 2006., 2006
- with David Arthur. and rina panigrahy, "Analyzing the Efficiency of BitTorrent and Related Peer-to-Peer Networks", in SODA 2006., 2006
- Rina Panigrahy, "Efficient Hashing with Lookups in two Memory Accesses"., in SODA 2005., 2005
- Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, and An Zhu, Approximation Algorithms for k-Anonymity, in Journal of Privacy Technology, 2005
- Liadan O'Callaghan., Moses Charikar, and Rina Panigrahy, "Better streaming algorithms for clustering problems", in STOC 2003., 2003
- with Tomas Feder, Rajeev Motwani, Liadan O'Callaghan, chris Olston., and Rina Panigrahy, "Computing Shortest Paths with Uncertainty", in STACS 2003., 2003
- Rina Panigrahy and Sundar Vishwanathan, An O(log^* n) approximation algorithm for the asymmetric p-center problem, in Journal of Algorithms, 27:259–268, 1998., 1998
- R. Karger, Rina Panigrahy, and Rina Panigrahy, Relieving hot spots on the world wide web, in In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997
- David Arthur and Rina Panigrahy, "Analyzing the Efficiency of BitTorrent and Related Peer-to-Peer Networks", in SODA 2006.
- Liadan O'Callaghan Moses Charikar and Rina Panigrahy, "Better streaming algorithms for clustering problems", in STOC 2003.
