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