dblp.uni-trier.dewww.uni-trier.de

Rina Panigrahy

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
59EEMarc Najork, Sreenivas Gollapudi, Rina Panigrahy: Less is more: sampling the neighborhood graph makes SALSA better and faster. WSDM 2009: 242-251
58EESriram C. Krishnan, Rina Panigrahy, Sunil Parthasarathy: Error-Correcting Codes for Ternary Content Addressable Memories. IEEE Trans. Computers 58(2): 275-279 (2009)
2008
57EERina Panigrahy, Kunal Talwar, Udi Wieder: A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. FOCS 2008: 414-423
56EERina Panigrahy: An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. LATIN 2008: 387-398
55EESreenivas Gollapudi, Rina Panigrahy: The power of two min-hashes for similarity search among hierarchical data objects. PODS 2008: 211-220
54EEAtish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy: Estimating PageRank on graph streams. PODS 2008: 69-78
53EEYinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, Ivan Osipkov: Spamming botnets: signatures and characteristics. SIGCOMM 2008: 171-182
52EEThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398
51EENitin 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
50EEAlexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy: Better Bounds for Frequency Moments in Random-Order Streams CoRR abs/0808.2222: (2008)
49EENoga Alon, Rina Panigrahy, Sergey Yekhanin: Deterministic Approximation Algorithms for the Nearest Codeword Problem. Electronic Colloquium on Computational Complexity (ECCC) 15(065): (2008)
2007
48EERavi Kumar, Rina Panigrahy: On Finding Frequent Elements in a Data Stream. APPROX-RANDOM 2007: 584-595
47EERina Panigrahy, Dilys Thomas: Finding Frequent Elements in Non-bursty Streams. ESA 2007: 53-62
46EERajeev Motwani, Rina Panigrahy, Ying Xu: Estimating Sum by Weighted Sampling. ICALP 2007: 53-64
45EESreenivas Gollapudi, Marc Najork, Rina Panigrahy: Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. WAW 2007: 195-201
44EERenato 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)
43EEMohammad 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)
42EETomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy: Computing shortest paths with uncertainty. J. Algorithms 62(1): 1-18 (2007)
41EERajeev Motwani, Assaf Naor, Rina Panigrahy: Lower Bounds on Locality Sensitive Hashing. SIAM J. Discrete Math. 21(4): 930-935 (2007)
2006
40EERajeev Motwani, Rina Panigrahy, Ying Xu: Fractional Matching Via Balls-and-Bins. APPROX-RANDOM 2006: 487-498
39EESreenivas Gollapudi, Rina Panigrahy: Exploiting asymmetry in hierarchical topic extraction. CIKM 2006: 475-482
38EEAndrei 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
37EESreenivas Gollapudi, Rina Panigrahy: A dictionary for approximate string search and longest prefix search. CIKM 2006: 768-775
36EEFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese: An Improved Construction for Counting Bloom Filters. ESA 2006: 684-695
35EEGagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu: Achieving anonymity via clustering. PODS 2006: 153-162
34EEFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese: Beyond bloom filters: from approximate membership checks to approximate state machines. SIGCOMM 2006: 315-326
33EERina Panigrahy: Entropy based nearest neighbor search in high dimensions. SODA 2006: 1186-1195
32EEKrishnaram Kenthapadi, Rina Panigrahy: Balanced allocation on graphs. SODA 2006: 434-443
31EEDavid Arthur, Rina Panigrahy: Analyzing BitTorrent and related peer-to-peer networks. SODA 2006: 961-969
30EERajeev Motwani, Assaf Naor, Rina Panigrahy: Lower bounds on locality sensitive hashing. Symposium on Computational Geometry 2006: 154-157
2005
29EEMohammad 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
28EEGagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu: Algorithms for the Database Layout Problem. ICDT 2005: 189-203
27EEGagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu: Anonymizing Tables. ICDT 2005: 246-258
26EERina Panigrahy: Efficient hashing with lookups in two memory accesses. SODA 2005: 830-839
25EERina Panigrahy: Entropy based Nearest Neighbor Search in High Dimensions CoRR abs/cs/0510019: (2005)
24EEKrishnaram Kenthapadi, Rina Panigrahy: Balanced Allocation on Graphs CoRR abs/cs/0510086: (2005)
23EERajeev Motwani, Assaf Naor, Rina Panigrahy: Lower bounds on Locality Sensitive Hashing CoRR abs/cs/0510088: (2005)
22EEMoses 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
21EERina Panigrahy: Minimum Enclosing Polytope in High Dimensions CoRR cs.CG/0407020: (2004)
20EERina Panigrahy: Efficient Hashing with Lookups in two Memory Accesses CoRR cs.DS/0407023: (2004)
19EEMoses Charikar, Rina Panigrahy: Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 68(2): 417-441 (2004)
18EETomá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
17EETomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy: Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366
16EETomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy: Computing Shortest Paths with Uncertainty. STACS 2003: 367-378
15EEMoses Charikar, Liadan O'Callaghan, Rina Panigrahy: Better streaming algorithms for clustering problems. STOC 2003: 30-39
14EERina Panigrahy, Samar Sharma: Sorting and Searching using Ternary CAMs. IEEE Micro 23(1): 44-53 (2003)
13EEMayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy: A combinatorial algorithm for MAX CSP. Inf. Process. Lett. 85(6): 307-315 (2003)
12EETomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom: Computing the Median with Uncertainty. SIAM J. Comput. 32(2): 538-547 (2003)
2002
11EESamar Sharma, Rina Panigrahy: Sorting and Searching Using Ternary CAMs. Hot Interconnects 2002: 101-106
10EERina Panigrahy, Samar Sharma: Reducing TCAM Power Consumption and Increasing Throughput. Hot Interconnects 2002: 107-114
9EEMoses Charikar, Piotr Indyk, Rina Panigrahy: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002: 451-462
8EETomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu: Web caching with request reordering. SODA 2002: 104-105
7EEMoses 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
6EEMoses Charikar, Rina Panigrahy: Clustering to minimize the sum of cluster diameters. STOC 2001: 1-10
2000
5EERajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, Suresh Venkatasubramanian: On the decidability of accessibility problems (extended abstract). STOC 2000: 306-315
4EETomá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
2EEDavid 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
1EERavi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram: A Note on Optical Routing on Trees. Inf. Process. Lett. 62(6): 295-300 (1997)

Coauthor Index

1Kannan Achan [53]
2Gagan Aggarwal [27] [28] [35]
3Nitin Agrawal [51]
4Mohammad J. Akhbarizadeh [29] [43]
5Noga Alon [49]
6Alexandr Andoni [50]
7David Arthur [31]
8Flavio Bonomi [34] [36]
9Andrei Z. Broder [38]
10Renato Carmo [44]
11Moses Charikar [6] [7] [9] [15] [19] [22]
12Mayur Datar [13]
13John D. Davis [51]
14Tomás Feder [4] [8] [12] [13] [16] [17] [18] [27] [28] [35] [42] [44]
15Marcus Fontoura [38]
16Aristides Gionis [13]
17Sreenivas Gollapudi [37] [39] [45] [54] [55] [59]
18Thomas Holenstein [52]
19Geoff Hulten [53]
20Piotr Indyk [9]
21Vanja Josifovski [38]
22David R. Karger [2]
23Krishnaram Kenthapadi [24] [27] [32] [35]
24Samir Khuller [35]
25Yoshiharu Kohayakawa [44]
26Sriram C. Krishnan [58]
27Ravi Kumar (S. Ravi Kumar) [1] [38] [48]
28Eduardo Sany Laber [44]
29April Rasala Lehman (April Rasala) [7]
30Eric Lehman [2] [7] [22]
31Frank Thomson Leighton (Tom Leighton) [2]
32Matthew S. Levine [2]
33Daniel Lewin [2]
34Ding Liu [7] [22]
35Mark S. Manasse (Mark Manasse) [51]
36Andrew McGregor [50]
37Adam Meyerson [17]
38Michael Mitzenmacher [34] [36] [52]
39Rajeev Motwani [4] [5] [8] [12] [13] [16] [17] [18] [23] [27] [28] [30] [38] [40] [41] [42] [44] [46]
40Shubha U. Nabar [38]
41Marc Najork [45] [59]
42Assaf Naor [23] [30] [41]
43Mehrdad Nourani [29] [43]
44Liadan O'Callaghan [15] [16] [17] [42] [44]
45Christopher Olston (Chris Olston) [4] [12] [16] [42]
46Krzysztof Onak [50]
47Ivan Osipkov [53]
48Sunil Parthasarathy [58]
49Manoj Prabhakaran [7] [22]
50Vijayan Prabhakaran [51]
51Alexander Russell [1]
52Amit Sahai [7] [22]
53Vijay A. Saraswat [5]
54Atish Das Sarma [54]
55Steven S. Seiden [18]
56Samar Sharma [10] [11] [14] [29] [43]
57Abhi Shelat [7] [22]
58Sushil Singh [34] [36]
59Rob van Stee [18]
60Ravi Sundaram [1]
61Kunal Talwar [57]
62Dilys Thomas [27] [35] [44] [47]
63Andrew Tomkins [38]
64George Varghese [34] [36]
65Suresh Venkatasubramanian [5]
66Sundar Vishwanathan [3]
67Jennifer Widom [4] [12]
68Udi Wieder [52] [57]
69Ted Wobber [51]
70Yinglian Xie [53]
71Ying Xu [38] [40] [46]
72Sergey Yekhanin [49]
73Fang Yu [53]
74An Zhu [8] [18] [27] [28] [35]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)