Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. - David R. Karger; Eric Lehman; Frank Thomson Leighton; Rina Panigrahy; Matthew S. Levine; Daniel Lewin 001 (STOC, 1997)

A Note on Optical Routing on Trees. - Ravi Kumar 001; Rina Panigrahy; Alexander Russell; Ravi Sundaram (Inf. Process. Lett., 1997)

An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. - Rina Panigrahy; Sundar Vishwanathan (J. Algorithms, 1998)

On the decidability of accessibility problems (extended abstract). - Rajeev Motwani 001; Rina Panigrahy; Vijay A. Saraswat; Suresh Venkatasubramanian (STOC, 2000)

Reducing TCAM Power Consumption and Increasing Throughput. - Rina Panigrahy; Samar Sharma (Hot Interconnects, 2002)

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. - Moses Charikar; Piotr Indyk; Rina Panigrahy (ICALP, 2002)

Web caching with request reordering. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (SODA, 2002)

Approximating the smallest grammar: Kolmogorov complexity in natural models. - Moses Charikar; Eric Lehman; Ding Liu; Rina Panigrahy; Manoj Prabhakaran 001; April Rasala; Amit Sahai; Abhi Shelat (STOC, 2002)

Representing Graph Metrics with Fewest Edges. - Tomás Feder; Adam Meyerson; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy (STACS, 2003)

Better streaming algorithms for clustering problems. - Moses Charikar; Liadan O'Callaghan; Rina Panigrahy (STOC, 2003)

A combinatorial algorithm for MAX CSP. - Mayur Datar; Tomás Feder; Aristides Gionis; Rajeev Motwani 001; Rina Panigrahy (Inf. Process. Lett., 2003)

Sorting and Searching using Ternary CAMs. - Rina Panigrahy; Samar Sharma (IEEE Micro, 2003)

Computing the Median with Uncertainty. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Chris Olston; Jennifer Widom (SIAM J. Comput., 2003)

Efficient multicast on a terabit router. - Punit Bhargava; Sriram C. Krishnan; Rina Panigrahy (Hot Interconnects, 2004)

Minimum Enclosing Polytope in High Dimensions - Rina Panigrahy (CoRR, 2004)

Clustering to minimize the sum of cluster diameters. - Moses Charikar; Rina Panigrahy (J. Comput. Syst. Sci., 2004)

Combining request scheduling with web caching. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Steven S. Seiden; Rob van Stee; An Zhu (Theor. Comput. Sci., 2004)

High-Speed and Low-Power Network Search Engine Using Adaptive Block-Selection Scheme. - Mohammad J. Akhbarizadeh; Mehrdad Nourani; Rina Panigrahy; Samar Sharma (Hot Interconnects, 2005)

Anonymizing Tables. - Gagan Aggarwal; Tomás Feder; Krishnaram Kenthapadi; Rajeev Motwani 001; Rina Panigrahy; Dilys Thomas; An Zhu (ICDT, 2005)

Algorithms for the Database Layout Problem. - Gagan Aggarwal; Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (ICDT, 2005)

Efficient hashing with lookups in two memory accesses. - Rina Panigrahy (SODA, 2005)

The smallest grammar problem. - Moses Charikar; Eric Lehman; Ding Liu; Rina Panigrahy; Manoj Prabhakaran 001; Amit Sahai; Abhi Shelat (IEEE Trans. Inf. Theory, 2005)

Fractional Matching Via Balls-and-Bins. - Rajeev Motwani 001; Rina Panigrahy; Ying Xu 002 (APPROX-RANDOM, 2006)

Estimating corpus size via queries. - Andrei Z. Broder; Marcus Fontoura; Vanja Josifovski; Ravi Kumar 001; Rajeev Motwani 001; Shubha U. Nabar; Rina Panigrahy; Andrew Tomkins; Ying Xu 002 (CIKM, 2006)

Exploiting asymmetry in hierarchical topic extraction. - Sreenivas Gollapudi; Rina Panigrahy (CIKM, 2006)

A dictionary for approximate string search and longest prefix search. - Sreenivas Gollapudi; Rina Panigrahy (CIKM, 2006)

An Improved Construction for Counting Bloom Filters. - Flavio Bonomi; Michael Mitzenmacher; Rina Panigrahy; Sushil Singh; George Varghese (ESA, 2006)

Beyond bloom filters: from approximate membership checks to approximate state machines. - Flavio Bonomi; Michael Mitzenmacher; Rina Panigrahy; Sushil Singh; George Varghese (SIGCOMM, 2006)

Analyzing BitTorrent and related peer-to-peer networks. - David Arthur; Rina Panigrahy (SODA, 2006)

Balanced allocation on graphs. - Krishnaram Kenthapadi; Rina Panigrahy (SODA, 2006)

Entropy based nearest neighbor search in high dimensions. - Rina Panigrahy (SODA, 2006)

On Finding Frequent Elements in a Data Stream. - Ravi Kumar 001; Rina Panigrahy (APPROX-RANDOM, 2007)

Finding Frequent Elements in Non-bursty Streams. - Rina Panigrahy; Dilys Thomas (ESA, 2007)

A Real-Time Worm Outbreak Detection System Using Shared Counters. - Miad Faezipour; Mehrdad Nourani; Rina Panigrahy (Hot Interconnects, 2007)

Estimating Sum by Weighted Sampling. - Rajeev Motwani 001; Rina Panigrahy; Ying Xu 002 (ICALP, 2007)

Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. - Sreenivas Gollapudi; Marc Najork; Rina Panigrahy (WAW, 2007)

Computing shortest paths with uncertainty. - Tomás Feder; Rajeev Motwani 001; Liadan O'Callaghan; Chris Olston; Rina Panigrahy (J. Algorithms, 2007)

Lower Bounds on Locality Sensitive Hashing. - Rajeev Motwani 001; Assaf Naor; Rina Panigrahy (SIAM J. Discret. Math., 2007)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding. - Mohammad J. Akhbarizadeh; Mehrdad Nourani; Rina Panigrahy; Samar Sharma (IEEE Trans. Computers, 2007)

Hashing, searching, sketching. - Rina Panigrahy (2007)

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. - Rina Panigrahy; Kunal Talwar; Udi Wieder (FOCS, 2008)

An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. - Rina Panigrahy (LATIN, 2008)

The power of two min-hashes for similarity search among hierarchical data objects. - Sreenivas Gollapudi; Rina Panigrahy (PODS, 2008)

Spamming botnets: signatures and characteristics. - Yinglian Xie; Fang Yu 002; Kannan Achan; Rina Panigrahy; Geoff Hulten; Ivan Osipkov (SIGCOMM, 2008)

Trace reconstruction with constant deletion probability and related results. - Thomas Holenstein; Michael Mitzenmacher; Rina Panigrahy; Udi Wieder (SODA, 2008)

Design Tradeoffs for SSD Performance. - Nitin Agrawal 001; Vijayan Prabhakaran; Ted Wobber; John D. Davis; Mark S. Manasse; Rina Panigrahy (USENIX ATC, 2008)

Better Bounds for Frequency Moments in Random-Order Streams - Alexandr Andoni; Andrew McGregor 001; Krzysztof Onak; Rina Panigrahy (CoRR, 2008)

Deterministic Approximation Algorithms for the Nearest Codeword Problem. - Noga Alon; Rina Panigrahy; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2008)

3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit. - Eric Lehman; Rina Panigrahy (ESA, 2009)

The Oil Searching Problem. - Andrew McGregor 001; Krzysztof Onak; Rina Panigrahy (ESA, 2009)

Sparse Cut Projections in Graph Streams. - Atish Das Sarma; Sreenivas Gollapudi; Rina Panigrahy (ESA, 2009)

Less is more: sampling the neighborhood graph makes SALSA better and faster. - Marc Najork; Sreenivas Gollapudi; Rina Panigrahy (WSDM, 2009)

Error-Correcting Codes for Ternary Content Addressable Memories. - Sriram C. Krishnan; Rina Panigrahy; Sunil Parthasarathy (IEEE Trans. Computers, 2009)

A hardware platform for efficient worm outbreak detection. - Miad Faezipour; Mehrdad Nourani; Rina Panigrahy (ACM Trans. Design Autom. Electr. Syst., 2009)

Lower Bounds on Near Neighbor Search via Metric Expansion. - Rina Panigrahy; Kunal Talwar; Udi Wieder (FOCS, 2010)

A sketch-based distance oracle for web-scale graphs. - Atish Das Sarma; Sreenivas Gollapudi; Marc Najork; Rina Panigrahy (WSDM, 2010)

Ranking mechanisms in twitter-like forums. - Anish Das Sarma; Atish Das Sarma; Sreenivas Gollapudi; Rina Panigrahy (WSDM, 2010)

Revisiting the Examination Hypothesis with Query Specific Position Bias - Sreenivas Gollapudi; Rina Panigrahy (CoRR, 2010)

Understanding Fashion Cycles as a Social Choice - Anish Das Sarma; Sreenivas Gollapudi; Rina Panigrahy; Li Zhang 001 (CoRR, 2010)

A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning - Rina Panigrahy (CoRR, 2010)

Understanding the Cycle of Knowledge: Its rise, preservation and decay - Rina Panigrahy (CoRR, 2010)

Achieving anonymity via clustering. - Gagan Aggarwal; Rina Panigrahy; Tomás Feder; Dilys Thomas; Krishnaram Kenthapadi; Samir Khuller; An Zhu (ACM Trans. Algorithms, 2010)

Multiplicative Approximations of Random Walk Transition Probabilities. - Michael Kapralov; Rina Panigrahy (APPROX-RANDOM, 2011)

Prediction strategies without loss. - Michael Kapralov; Rina Panigrahy (NIPS, 2011)

Context-based Online Configuration-Error Detection. - Yinglian Xie; Rina Panigrahy; Junfeng Yang; Chad Verbowski; Arunvijay Kumar (USENIX ATC, 2011)

Estimating PageRank on graph streams. - Atish Das Sarma; Sreenivas Gollapudi; Rina Panigrahy (J. ACM, 2011)

NNS Lower Bounds via Metric Expansion for l ∞ and EMD. - Michael Kapralov; Rina Panigrahy (ICALP (1), 2012)

Spectral sparsification via random spanners. - Michael Kapralov; Rina Panigrahy (ITCS, 2012)

How user behavior is related to social affinity. - Rina Panigrahy; Marc Najork; Yinglian Xie (WSDM, 2012)

Understanding cyclic trends in social choices. - Anish Das Sarma; Sreenivas Gollapudi; Rina Panigrahy; Li Zhang 001 (WSDM, 2012)

The Mind Grows Circuits - Rina Panigrahy; Li Zhang 001 (CoRR, 2012)

Debiasing social wisdom. - Abhimanyu Das; Sreenivas Gollapudi; Rina Panigrahy; Mahyar Salek (KDD, 2013)

Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries. - Rina Panigrahy (WALCOM, 2013)

Sparse Matrix Factorization. - Behnam Neyshabur; Rina Panigrahy (CoRR, 2013)

A Differential Equations Approach to Optimizing Regret Trade-offs - Alexandr Andoni; Rina Panigrahy (CoRR, 2013)

Learning Polynomials with Neural Networks. - Alexandr Andoni; Rina Panigrahy; Gregory Valiant; Li Zhang 001 (ICML, 2014)

Learning Sparse Polynomial Functions. - Alexandr Andoni; Rina Panigrahy; Gregory Valiant; Li Zhang 001 (SODA, 2014)

Optimal amortized regret in every interval. - Rina Panigrahy; Preyas Popat (UAI, 2014)

Fractal Structures in Adversarial Prediction. - Rina Panigrahy; Preyas Popat (ITCS, 2015)

Partitioning Orders in Online Shopping Services. - Sreenivas Gollapudi; Ravi Kumar 001; Debmalya Panigrahi; Rina Panigrahy (CIKM, 2017)

Algorithms for $ ell_p$ Low-Rank Approximation. - Flavio Chierichetti; Sreenivas Gollapudi; Ravi Kumar 001; Silvio Lattanzi; Rina Panigrahy; David P. Woodruff (ICML, 2017)

Electron-Proton Dynamics in Deep Learning. - Qiuyi Zhang 001; Rina Panigrahy; Sushant Sachdeva (CoRR, 2017)

Convergence Results for Neural Networks via Electrodynamics. - Rina Panigrahy; Ali Rahimi; Sushant Sachdeva; Qiuyi Zhang 001 (ITCS, 2018)

Faster Algorithms for Binary Matrix Factorization. - Ravi Kumar 001; Rina Panigrahy; Ali Rahimi; David P. Woodruff (ICML, 2019)

Recursive Sketches for Modular Deep Learning. - Badih Ghazi; Rina Panigrahy; Joshua R. Wang (ICML, 2019)

Learning Two layer Networks with Multinomial Activation and High Thresholds. - Surbhi Goel; Rina Panigrahy (CoRR, 2019)

On the Learnability of Deep Random Networks. - Abhimanyu Das; Sreenivas Gollapudi; Ravi Kumar 001; Rina Panigrahy (CoRR, 2019)

How does the Mind store Information? - Rina Panigrahy (CoRR, 2019)

On the Learnability of Random Deep Networks. - Abhimanyu Das; Sreenivas Gollapudi; Ravi Kumar 001; Rina Panigrahy (SODA, 2020)

Learning the gravitational force law and other analytic functions. - Atish Agarwala; Abhimanyu Das; Rina Panigrahy; Qiuyi Zhang 001 (CoRR, 2020)

Sketch based Memory for Neural Networks. - Rina Panigrahy; Xin Wang 016; Manzil Zaheer (AISTATS, 2021)

One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks. - Atish Agarwala; Abhimanyu Das; Brendan Juba; Rina Panigrahy; Vatsal Sharan; Xin Wang 116; Qiuyi Zhang 001 (ICLR, 2021)

For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions. - Nishanth Dikkala; Gal Kaplun; Rina Panigrahy (CoRR, 2021)

Provable Hierarchical Lifelong Learning with a Sketch-based Modular Architecture. - Zihao Deng; Zee Fryer; Brendan Juba; Rina Panigrahy; Xin Wang 116 (CoRR, 2021)

A Unified Cascaded Encoder ASR Model for Dynamic Model Sizes. - Shaojin Ding; Weiran Wang; Ding Zhao; Tara N. Sainath; Yanzhang He; Robert David; Rami Botros; Xin Wang 016; Rina Panigrahy; Qiao Liang 001; Dongseong Hwang; Ian McGraw; et al. (INTERSPEECH, 2022)

A Theoretical View on Sparsely Activated Networks. - Cenk Baykal; Nishanth Dikkala; Rina Panigrahy; Cyrus Rashtchian; Xin Wang 016 (NeurIPS, 2022)

Sketching based Representations for Robust Image Classification with Provable Guarantees. - Nishanth Dikkala; Sankeerth Rao Karingula; Raghu Meka; Jelani Nelson; Rina Panigrahy; Xin Wang 016 (NeurIPS, 2022)

On the Benefits of Learning to Route in Mixture-of-Experts Models. - Nishanth Dikkala; Nikhil Ghosh; Raghu Meka; Rina Panigrahy; Nikhil Vyas 001; Xin Wang 016 (EMNLP, 2023)

Alternating Updates for Efficient Transformers. - Cenk Baykal; Dylan J. Cutler; Nishanth Dikkala; Nikhil Ghosh; Rina Panigrahy; Xin Wang 116 (NeurIPS, 2023)

Alternating Updates for Efficient Transformers. - Cenk Baykal; Dylan J. Cutler; Nishanth Dikkala; Nikhil Ghosh; Rina Panigrahy; Xin Wang 016 (CoRR, 2023)

The Power of External Memory in Increasing Predictive Model Capacity. - Cenk Baykal; Dylan J. Cutler; Nishanth Dikkala; Nikhil Ghosh; Rina Panigrahy; Xin Wang 016 (CoRR, 2023)

Simple Mechanisms for Representing, Indexing and Manipulating Concepts. - Yuanzhi Li; Raghu Meka; Rina Panigrahy; Kulin Shah (CoRR, 2023)

Causal language modeling can elicit search and reasoning capabilities on logic puzzles. - Kulin Shah; Nishanth Dikkala; Xin Wang; Rina Panigrahy (NeurIPS, 2024)

Causal Language Modeling Can Elicit Search and Reasoning Capabilities on Logic Puzzles. - Kulin Shah; Nishanth Dikkala; Xin Wang 016; Rina Panigrahy (CoRR, 2024)

How Transformers Solve Propositional Logic Problems: A Mechanistic Analysis. - Guanzhe Hong; Nishanth Dikkala; Enming Luo; Cyrus Rashtchian; Xin Wang 016; Rina Panigrahy (CoRR, 2024)

StagFormer: Time Staggering Transformer Decoding for RunningLayers In Parallel. - Dylan J. Cutler; Arun Kandoor; Nishanth Dikkala; Nikunj Saunshi; Xin Wang; Rina Panigrahy (CoRR, 2025)

Universal Model Routing for Efficient LLM Inference. - Wittawat Jitkrittum; Harikrishna Narasimhan; Ankit Singh Rawat; Jeevesh Juneja; Zifeng Wang; Chen-Yu Lee; Pradeep Shenoy; Rina Panigrahy; Aditya Krishna Menon; Sanjiv Kumar (CoRR, 2025)

Latent Concept Disentanglement in Transformer-based Language Models. - Guanzhe Hong; Bhavya Vasudeva; Vatsal Sharan; Cyrus Rashtchian; Prabhakar Raghavan; Rina Panigrahy (CoRR, 2025)