| 2011 |
|---|
| 75 | Multiplicative Approximations of Random Walk Transition Probabilities. Michael Kapralov, Rina Panigrahy. APPROX-RANDOM 2011, 266-276. Web SearchBibTeXDownload |
| 74 | Estimating PageRank on graph streams. Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy. J. ACM (58): 13 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 73 | Achieving anonymity via clustering. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Samir Khuller, An Zhu. ACM Transactions on Algorithms (6) (2010). Cited by 109Web SearchBibTeXDownload |
| 72 | Lower Bounds on Near Neighbor Search via Metric Expansion. Rina Panigrahy, Kunal Talwar, Udi Wieder. CoRR (abs/1005.0418) (2010). Web SearchBibTeXDownload |
| 71 | Prediction strategies without loss. Michael Kapralov, Rina Panigrahy. CoRR (abs/1008.3672) (2010). Web SearchBibTeXDownload |
| 70 | Understanding Fashion Cycles as a Social Choice. Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang. CoRR (abs/1009.2617) (2010). Web SearchBibTeXDownload |
| 69 | Revisiting the Examination Hypothesis with Query Specific Position Bias. Sreenivas Gollapudi, Rina Panigrahy. CoRR (abs/1003.2458) (2010). Web SearchBibTeXDownload |
| 68 | Understanding the Cycle of Knowledge: Its rise, preservation and decay. Rina Panigrahy. CoRR (abs/1011.1979) (2010). Web SearchBibTeXDownload |
| 67 | A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning. Rina Panigrahy. CoRR (abs/1011.0046) (2010). Web SearchBibTeXDownload |
| 66 | Ranking mechanisms in twitter-like forums. Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy. WSDM 2010, 21-30. Web SearchBibTeXDownload |
| 65 | A sketch-based distance oracle for web-scale graphs. Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy. WSDM 2010, 401-410. Web SearchBibTeXDownload |
| 2009 |
|---|
| 64 | A hardware platform for efficient worm outbreak detection. Miad Faezipour, Mehrdad Nourani, Rina Panigrahy. ACM Trans. Design Autom. Electr. Syst. (14) (2009). Web SearchBibTeXDownload |
| 63 | Deterministic Approximation Algorithms for the Nearest Codeword Problem. Noga Alon, Rina Panigrahy, Sergey Yekhanin. APPROX-RANDOM 2009, 339-351. Web SearchBibTeXDownload |
| 62 | The Oil Searching Problem. Andrew McGregor, Krzysztof Onak, Rina Panigrahy. ESA 2009, 504-515. Web SearchBibTeXDownload |
| 61 | 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit. Eric Lehman, Rina Panigrahy. ESA 2009, 671-681. Web SearchBibTeXDownload |
| 60 | Sparse Cut Projections in Graph Streams. Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy. ESA 2009, 480-491. Web SearchBibTeXDownload |
| 59 | Error-Correcting Codes for Ternary Content Addressable Memories. Sriram C. Krishnan, Rina Panigrahy, Sunil Parthasarathy. IEEE Trans. Computers (58): 275-279 (2009). Web SearchBibTeXDownload |
| 58 | Less is more: sampling the neighborhood graph makes SALSA better and faster. Marc Najork, Sreenivas Gollapudi, Rina Panigrahy. WSDM 2009, 242-251. Web SearchBibTeXDownload |
| 2008 |
|---|
| 57 | Better Bounds for Frequency Moments in Random-Order Streams. Alexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy. CoRR (abs/0808.2222) (2008). Web SearchBibTeXDownload |
| 56 | Deterministic Approximation Algorithms for the Nearest Codeword Problem. Noga Alon, Rina Panigrahy, Sergey Yekhanin. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload |
| 55 | A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. Rina Panigrahy, Kunal Talwar, Udi Wieder. FOCS 2008, 414-423. Web SearchBibTeXDownload |
| 54 | An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. Rina Panigrahy. LATIN 2008, 387-398. Web SearchBibTeXDownload |
| 53 | Estimating PageRank on graph streams. Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy. PODS 2008, 69-78. Web SearchBibTeXDownload |
| 52 | The power of two min-hashes for similarity search among hierarchical data objects. Sreenivas Gollapudi, Rina Panigrahy. PODS 2008, 211-220. Web SearchBibTeXDownload |
| 51 | Spamming botnets: signatures and characteristics. Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, Ivan Osipkov. SIGCOMM 2008, 171-182. Web SearchBibTeXDownload |
| 50 | Trace reconstruction with constant deletion probability and related results. Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder. SODA 2008, 389-398. Web SearchBibTeXDownload |
| 49 | Design Tradeoffs for SSD Performance. Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark S. Manasse, Rina Panigrahy. USENIX Annual Technical Conference 2008, 57-70. Web SearchBibTeXDownload |
| 2007 |
|---|
| 48 | Querying priced information in databases: The conjunctive case. Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas. ACM Transactions on Algorithms (3) (2007). Cited by 3Web SearchBibTeXDownload |
| 47 | On Finding Frequent Elements in a Data Stream. Ravi Kumar, Rina Panigrahy. APPROX-RANDOM 2007, 584-595. Web SearchBibTeXDownload |
| 46 | Finding Frequent Elements in Non-bursty Streams. Rina Panigrahy, Dilys Thomas. ESA 2007, 53-62. Web SearchBibTeXDownload |
| 45 | Estimating Sum by Weighted Sampling. Rajeev Motwani, Rina Panigrahy, Ying Xu. ICALP 2007, 53-64. Cited by 2Web SearchBibTeXDownload |
| 44 | A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding. Mohammad J. Akhbarizadeh, Mehrdad Nourani, Rina Panigrahy, Samar Sharma. IEEE Trans. Computers (56): 58-72 (2007). Web SearchBibTeXDownload |
| 43 | Computing shortest paths with uncertainty. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy. J. Algorithms (62): 1-18 (2007). Cited by 8Web SearchBibTeXDownload |
| 42 | Lower Bounds on Locality Sensitive Hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. SIAM J. Discrete Math. (21): 930-935 (2007). Web SearchBibTeXDownload |
| 41 | Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. Sreenivas Gollapudi, Marc Najork, Rina Panigrahy. WAW 2007, 195-201. Web SearchBibTeXDownload |
| 2006 |
|---|
| 40 | Fractional Matching Via Balls-and-Bins. Rajeev Motwani, Rina Panigrahy, Ying Xu. APPROX-RANDOM 2006, 487-498. Cited by 2Web SearchBibTeXDownload |
| 39 | Exploiting asymmetry in hierarchical topic extraction. Sreenivas Gollapudi, Rina Panigrahy. CIKM 2006, 475-482. Web SearchBibTeXDownload |
| 38 | A dictionary for approximate string search and longest prefix search. Sreenivas Gollapudi, Rina Panigrahy. CIKM 2006, 768-775. Web SearchBibTeXDownload |
| 37 | Estimating corpus size via queries. Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu. CIKM 2006, 594-603. Cited by 21Web SearchBibTeXDownload |
| 36 | An Improved Construction for Counting Bloom Filters. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese. ESA 2006, 684-695. Web SearchBibTeXDownload |
| 35 | Achieving anonymity via clustering. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Samir Khuller, An Zhu. PODS 2006, 153-162. Cited by 109Web SearchBibTeXDownload |
| 34 | Beyond bloom filters: from approximate membership checks to approximate state machines. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese. SIGCOMM 2006, 315-326. Web SearchBibTeXDownload |
| 33 | Analyzing BitTorrent and related peer-to-peer networks. David Arthur, Rina Panigrahy. SODA 2006, 961-969. Web SearchBibTeXDownload |
| 32 | Entropy based nearest neighbor search in high dimensions. Rina Panigrahy. SODA 2006, 1186-1195. Web SearchBibTeXDownload |
| 31 | Balanced allocation on graphs. Krishnaram Kenthapadi, Rina Panigrahy. SODA 2006, 434-443. Web SearchBibTeXDownload |
| 30 | Lower bounds on locality sensitive hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. Symposium on Computational Geometry 2006, 154-157. Cited by 18Web SearchBibTeXDownload |
| 2005 |
|---|
| 29 | Balanced Allocation on Graphs. Krishnaram Kenthapadi, Rina Panigrahy. CoRR (abs/cs/0510086) (2005). Web SearchBibTeXDownload |
| 28 | Lower bounds on Locality Sensitive Hashing. Rajeev Motwani, Assaf Naor, Rina Panigrahy. CoRR (abs/cs/0510088) (2005). Web SearchBibTeXDownload |
| 27 | Entropy based Nearest Neighbor Search in High Dimensions. Rina Panigrahy. CoRR (abs/cs/0510019) (2005). Web SearchBibTeXDownload |
| 26 | 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, 73-78. Web SearchBibTeXDownload |
| 25 | Algorithms for the Database Layout Problem. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu. ICDT 2005, 189-203. Cited by 1Web SearchBibTeXDownload |
| 24 | Anonymizing Tables. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu. ICDT 2005, 246-258. Web SearchBibTeXDownload |
| 23 | The smallest grammar problem. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat. IEEE Transactions on Information Theory (51): 2554-2576 (2005). Web SearchBibTeXDownload |
| 22 | Efficient hashing with lookups in two memory accesses. Rina Panigrahy. SODA 2005, 830-839. Web SearchBibTeXDownload |
| 2004 |
|---|
| 21 | Efficient Hashing with Lookups in two Memory Accesses. Rina Panigrahy. CoRR (cs.DS/0407023) (2004). Web SearchBibTeXDownload |
| 20 | Minimum Enclosing Polytope in High Dimensions. Rina Panigrahy. CoRR (cs.CG/0407020) (2004). Web SearchBibTeXDownload |
| 19 | Clustering to minimize the sum of cluster diameters. Moses Charikar, Rina Panigrahy. J. Comput. Syst. Sci. (68): 417-441 (2004). Web SearchBibTeXDownload |
| 18 | Combining request scheduling with web caching. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu. Theor. Comput. Sci. (324): 201-218 (2004). Cited by 7Web SearchBibTeXDownload |
| 2003 |
|---|
| 17 | Sorting and Searching using Ternary CAMs. Rina Panigrahy, Samar Sharma. IEEE Micro (23): 44-53 (2003). Web SearchBibTeXDownload |
| 16 | A combinatorial algorithm for MAX CSP. Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy. Inf. Process. Lett. (85): 307-315 (2003). Cited by 9Web SearchBibTeXDownload |
| 15 | Computing the Median with Uncertainty. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom. SIAM J. Comput. (32): 538-547 (2003). Web SearchBibTeXDownload |
| 14 | Computing Shortest Paths with Uncertainty. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy. STACS 2003, 367-378. Web SearchBibTeXDownload |
| 13 | Representing Graph Metrics with Fewest Edges. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy. STACS 2003, 355-366. Cited by 5Web SearchBibTeXDownload |
| 12 | Better streaming algorithms for clustering problems. Moses Charikar, Liadan O'Callaghan, Rina Panigrahy. STOC 2003, 30-39. Cited by 126Web SearchBibTeXDownload |
| 2002 |
|---|
| 11 | Sorting and Searching Using Ternary CAMs. Samar Sharma, Rina Panigrahy. Hot Interconnects 2002, 101-106. Web SearchBibTeXDownload |
| 10 | Reducing TCAM Power Consumption and Increasing Throughput. Rina Panigrahy, Samar Sharma. Hot Interconnects 2002, 107-114. Web SearchBibTeXDownload |
| 9 | New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. Moses Charikar, Piotr Indyk, Rina Panigrahy. ICALP 2002, 451-462. Cited by 18Web SearchBibTeXDownload |
| 8 | Web caching with request reordering. Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu. SODA 2002, 104-105. Cited by 14Web SearchBibTeXDownload |
| 7 | Approximating the smallest grammar: Kolmogorov complexity in natural models. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat. STOC 2002, 792-801. Web SearchBibTeXDownload |
| 2001 |
|---|
| 6 | Clustering to minimize the sum of cluster diameters. Moses Charikar, Rina Panigrahy. STOC 2001, 1-10. Web SearchBibTeXDownload |
| 2000 |
|---|
| 5 | On the decidability of accessibility problems (extended abstract). Rajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, Suresh Venkatasubramanian. STOC 2000, 306-315. Cited by 18Web SearchBibTeXDownload |
| 4 | Computing the median with uncertainty. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom. STOC 2000, 602-607. Cited by 23Web SearchBibTeXDownload |
| 1998 |
|---|
| 3 | An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. Sundar Vishwanathan, Sundar Vishwanathan. J. Algorithms (27): 259-268 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 2 | A Note on Optical Routing on Trees. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram. Inf. Process. Lett. (62): 295-300 (1997). Web SearchBibTeXDownload |
| 1 | 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. STOC 1997, 654-663. Web SearchBibTeXDownload |
