[Edit]

Rina Panigrahy
(ALIAS: R. Panigrahy) [FOAF]  [Follow]

Email:
Homepage: http://theory.stanford.edu/~rinap/
[Edit]
Statistics: H-index: 21 (See all experts' h-index.)
total citation number: 2247
highest-cited paper: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (1997) at STOC (Cited By 1013)

Research Interest:

Locality Sensitive Hashing, Nearest Codeword Problem, Deterministic Approximation Algorithms, Lower Bounds, Ternary CAMs

Show Temporal Interests (Do you want to see the change of his/her research interests?)


Publications: [Edit disambiguation Result]

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