Rina Panigrahy

Selected Publications (Full list)

• Rina Panigrahy, Xin Wang, Manzil Zaheer, Sketch based Memory for Neural Networks , AISTATS 2021
• Atish Agarwala, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Richard Zhang, One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks , ICLR 2021
• Rina Panigrahy, How does the Mind store Information? , Arxiv.
• Badih Ghazi, Rina Panigrahy, Joshua Wang, Recursive Sketching for Modular Deep Networks , ICML 2019
• Rina Panigrahy, Preyas Popat, Fractal Structures in Adversarial Prediction , ITCS 2015
• Alexandr Andoni, Rina Panigrahy, Gregory Valiant, and Li Zhang, Learning polynomials with neural networks , ICML, June 2014
• Alexandr Andoni, Rina Panigrahy, Gregory Valiant, and Li Zhang, Learning sparse polynomials, SODA, ACM, 2014
• Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, and Li Zhang, Undertanding cyclic trends in social choices, Proc. ACM Conf on Web Search and Data Mining, ACM, February 2012
• Rina Panigrahy, Marc Najork, and Yinglian Xie, How User Behavior is Related to Social Affinity, in 5th ACM International Conference on Web Search and Data Mining (WSDM), ACM, February 2012
• Michael Kapralov and Rina Panigrahy, Prediction strategies without loss, Neural Information Processing Systems Foundation, 2012
• Michael Kapralov and Rina Panigrahy, Spectral sparsification via random spanners , Innovations in Theoretical Computer Science, 2012
• Rina Panigrahy, Kunal Talwar, and Udi Wieder, Lower Bounds on Near Neighbor Search via Metric Expansion , FOCS , IEEE Computer Society, October 2010
• Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, A Sketch-Based Distance Oracle for Web-Scale Graphs , 3rd ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., February 2010
• Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Ranking Mechanisms for Twitter-Like Forums, Proc. of Third ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., 2010
• Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy, Less is More: Sampling the Neighborhood Graph Makes SALSA Better and Faster, 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, ESA, Springer Verlag, 2009
• Rina Panigrahy, Kunal Talwar, and Udi Wieder, A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match, FOCS '08: Proceedings of the 49th annual IEEE Symposium on Foundations of Computer Science, IEEE, October 2008
• Sreenivas Gollapudi and Rina Panigrahy, The power of two min-hashes in similarity search among hierarchical data objects, Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, Inc., June 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

Learning and Prediction

• Nishanth Dikkala, Gal Kaplun, Rina Panigrahy, For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions , Arxiv.
• Rina Panigrahy, Xin Wang, Manzil Zaheer, Sketch based Memory for Neural Networks , AISTATS 2021
• Atish Agarwala, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Richard Zhang, One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks , ICLR 2021
• Rina Panigrahy, How does the Mind store Information? , Arxiv.
• Badih Ghazi, Rina Panigrahy, Joshua Wang, Recursive Sketching for Modular Deep Networks , ICML 2019
• Rina Panigrahy, Sushant Sachdeva, Qiuyi Zhang, Convergence Results for Neural Networks via Electrodynamics , ITCS 2018
• Rina Panigrahy, Preyas Popat, Fractal Structures in Adversarial Prediction , ITCS 2015
• Alexandr Andoni, Rina Panigrahy, Gregory Valiant, and Li Zhang, Learning polynomials with neural networks , ICML, June 2014
• Alexandr Andoni, Rina Panigrahy, Gregory Valiant, and Li Zhang, Learning sparse polynomials, SODA, ACM, 2014
• Michael Kapralov and Rina Panigrahy, Prediction strategies without loss, Neural Information Processing Systems Foundation, 2012

Hashing, Streaming, Similarity Search

• Rina Panigrahy, Kunal Talwar, and Udi Wieder, Lower Bounds on Near Neighbor Search via Metric Expansion , FOCS , IEEE Computer Society, October 2010
• Eric Lehman and Rina Panigrahy, 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit, ESA, Springer Verlag, 2009
• Rina Panigrahy, Kunal Talwar, and Udi Wieder, A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match, FOCS '08: Proceedings of the 49th annual IEEE Symposium on Foundations of Computer Science, IEEE, October 2008
• Sreenivas Gollapudi and Rina Panigrahy, The power of two min-hashes in similarity search among hierarchical data objects, Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, Inc., June 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
• Rina Panigrahy, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees , in Latin American Symposium on Theoretical Informatics (LATIN), Springer, Buzios, Brazil, April 2008
• S. Gollapudi and R. Panigrahy, A Dictionary for Approximate String Search and Longest Prefix Search, CIKM 2006.
• Rina Panigrahy and Krishnaram Kenthapadi, Balanced Allocation on Graphs (best student paper award), SODA 2006.
• Rina Panigrahy, Efficient Hashing with Lookups in two Memory Accesses, SODA 2005.
• Moses Charikar, Liadan O'Callaghan, and Rina Panigrahy, Better streaming algorithms for clustering problems, STOC 2003

Large Graphs and Social Networks

• Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, and Li Zhang, Undertanding cyclic trends in social choices, Proc. ACM Conf on Web Search and Data Mining, ACM, February 2012
• Rina Panigrahy, Marc Najork, and Yinglian Xie, How User Behavior is Related to Social Affinity, in 5th ACM International Conference on Web Search and Data Mining (WSDM), ACM, February 2012
• Michael Kapralov and Rina Panigrahy, Spectral sparsification via random spanners , Innovations in Theoretical Computer Science, 2012
• Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, A Sketch-Based Distance Oracle for Web-Scale Graphs , 3rd ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., February 2010
• Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Ranking Mechanisms for Twitter-Like Forums, Proc. of Third ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., 2010
• 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
• A. Broder, M. Fontoura, V. Josifovski, R. Kumar, R. Motwani, and R. Panigrahy, Estimating Corpus Size via Queries, CIKM 2006

Network Algorithms

• Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, and Ivan Osipkov, Spamming Botnet: Signatures and Characteristics , ACM SIGCOMM 2008, Seattle, WA, August 2008
• with Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, and George Varghese Compact Approximate Representations of Concurrent State Machines for Network Applications , Proceedings of the ACM SIGCOMM Conference, Pisa, Italy, September 2006.
• Rina Panigrahy, Samar Sharma, Sorting and Searching using Ternary CAMs , Hot Interconnects 2002. Also in IEEE Micro 23(1): 44-53 (2003)
• Rina Panigrahy, Samar Sharma, Reducing TCAM Power Consumption and Increasing Throughput , Hot Interconnects 2002
• David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 654-663, El Paso, Texas, 4-6 May 1997.

Awards

• Best paper award in PODS 2008.
• Best student paper award in SODA 2005.
• Received the Gold Star Award at Microsoft Research for technology transfer and product impact 2010
• Masters Thesis work at MIT was used as the founding technology at Akamai Technologies.
• Won a Gold Medal at the 31st International Mathematics Olympiad, 1990, Beijing, China among 308 participants from 53 countries. Also won a Silver Medal at the 32nd International Mathematics Olympiad, 1991, Sigtuna, Sweden.
• Top rank at the All India Entrance Examination for admission to IIT among 80,000 candidates nationwide, 1990.

Program Committees

PC member at KDD15, KDD 14, WWW 14, ICWSM 14, STOC 2013, WSDM 2013, STOC 2012, KDD 2012, SODA 2012, ESA 2012, WWW 2012, KDD 2011, WWW 2011, SODA 2010, ICDM 2010, ALENEX09, WWW09. Served as an NSF Panelist (Algorithms) in 2011 and 2015.

Student Interns

• Alex Andoni from MIT, now faculty member at Columbia University,
• Krsyztoff Onak from MIT, now at IBM T.J. Watson
• Nikhil Srivastava from Yale, now faculty member at U.C.Berkeley,
• Atish Das Sarma from Georgia Tech,
• Ding Yuan from UIUC, now at UToronto,
• Preyas Popat from UIUC, now at Google,
• Mikhal Kapralov from Stanford, soon to be at EPFL
• Behnam Neyshabur from TTI Chicago.
• Majid Janzamin from UC Irvine.