The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rina Panigrahy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
    Computing the median with uncertainty. [Citation Graph (1, 0)][DBLP]
    STOC, 2000, pp:602-607 [Conf]
  2. Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
    Fractional Matching Via Balls-and-Bins. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:487-498 [Conf]
  3. Sreenivas Gollapudi, Rina Panigrahy
    Exploiting asymmetry in hierarchical topic extraction. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:475-482 [Conf]
  4. Sreenivas Gollapudi, Rina Panigrahy
    A dictionary for approximate string search and longest prefix search. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:768-775 [Conf]
  5. Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu 0002
    Estimating corpus size via queries. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:594-603 [Conf]
  6. Rajeev Motwani, Assaf Naor, Rina Panigrahy
    Lower bounds on locality sensitive hashing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:154-157 [Conf]
  7. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
    An Improved Construction for Counting Bloom Filters. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:684-695 [Conf]
  8. Mohammad J. Akhbarizadeh, Mehrdad Nourani, Rina Panigrahy, Samar Sharma
    High-Speed and Low-Power Network Search Engine Using Adaptive Block-Selection Scheme. [Citation Graph (0, 0)][DBLP]
    Hot Interconnects, 2005, pp:73-78 [Conf]
  9. Moses Charikar, Piotr Indyk, Rina Panigrahy
    New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:451-462 [Conf]
  10. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu
    Anonymizing Tables. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:246-258 [Conf]
  11. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
    Algorithms for the Database Layout Problem. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:189-203 [Conf]
  12. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
    Achieving anonymity via clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:153-162 [Conf]
  13. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
    Beyond bloom filters: from approximate membership checks to approximate state machines. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2006, pp:315-326 [Conf]
  14. David Arthur, Rina Panigrahy
    Analyzing BitTorrent and related peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:961-969 [Conf]
  15. Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
    Web caching with request reordering. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:104-105 [Conf]
  16. Krishnaram Kenthapadi, Rina Panigrahy
    Balanced allocation on graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:434-443 [Conf]
  17. Rina Panigrahy
    Efficient hashing with lookups in two memory accesses. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:830-839 [Conf]
  18. Rina Panigrahy
    Entropy based nearest neighbor search in high dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1186-1195 [Conf]
  19. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy
    Representing Graph Metrics with Fewest Edges. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:355-366 [Conf]
  20. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
    Computing Shortest Paths with Uncertainty. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:367-378 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:792-801 [Conf]
  22. Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
    Better streaming algorithms for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:30-39 [Conf]
  23. Moses Charikar, Rina Panigrahy
    Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:1-10 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:654-663 [Conf]
  25. Rajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, Suresh Venkatasubramanian
    On the decidability of accessibility problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:306-315 [Conf]
  26. Rina Panigrahy
    Minimum Enclosing Polytope in High Dimensions [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  27. Rina Panigrahy
    Efficient Hashing with Lookups in two Memory Accesses [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  28. Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy
    A combinatorial algorithm for MAX CSP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:307-315 [Journal]
  29. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram
    A Note on Optical Routing on Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:295-300 [Journal]
  30. Rina Panigrahy, Sundar Vishwanathan
    An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:259-268 [Journal]
  31. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
    Computing shortest paths with uncertainty. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2007, v:62, n:1, pp:1-18 [Journal]
  32. Moses Charikar, Rina Panigrahy
    Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:417-441 [Journal]
  33. Rina Panigrahy, Samar Sharma
    Sorting and Searching using Ternary CAMs. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2003, v:23, n:1, pp:44-53 [Journal]
  34. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
    Computing the Median with Uncertainty. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:538-547 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  36. Mohammad J. Akhbarizadeh, Mehrdad Nourani, Rina Panigrahy, Samar Sharma
    A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:1, pp:58-72 [Journal]
  37. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
    Combining request scheduling with web caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:201-218 [Journal]
  38. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat
    The smallest grammar problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2554-2576 [Journal]
  39. Ravi Kumar, Rina Panigrahy
    On Finding Frequent Elements in a Data Stream. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:584-595 [Conf]
  40. Rina Panigrahy, Dilys Thomas
    Finding Frequent Elements in Non-bursty Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:53-62 [Conf]
  41. Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
    Estimating Sum by Weighted Sampling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:53-64 [Conf]
  42. Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
    Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:195-201 [Conf]

  43. Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]


  44. 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit. [Citation Graph (, )][DBLP]


  45. Sparse Cut Projections in Graph Streams. [Citation Graph (, )][DBLP]


  46. The Oil Searching Problem. [Citation Graph (, )][DBLP]


  47. A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. [Citation Graph (, )][DBLP]


  48. Reducing TCAM Power Consumption and Increasing Throughput. [Citation Graph (, )][DBLP]


  49. Sorting and Searching Using Ternary CAMs. [Citation Graph (, )][DBLP]


  50. An Improved Algorithm Finding Nearest Neighbor Using Kd-trees. [Citation Graph (, )][DBLP]


  51. The power of two min-hashes for similarity search among hierarchical data objects. [Citation Graph (, )][DBLP]


  52. Estimating PageRank on graph streams. [Citation Graph (, )][DBLP]


  53. Spamming botnets: signatures and characteristics. [Citation Graph (, )][DBLP]


  54. Trace reconstruction with constant deletion probability and related results. [Citation Graph (, )][DBLP]


  55. Design Tradeoffs for SSD Performance. [Citation Graph (, )][DBLP]


  56. A sketch-based distance oracle for web-scale graphs. [Citation Graph (, )][DBLP]


  57. Ranking mechanisms in twitter-like forums. [Citation Graph (, )][DBLP]


  58. Less is more: sampling the neighborhood graph makes SALSA better and faster. [Citation Graph (, )][DBLP]


  59. Entropy based Nearest Neighbor Search in High Dimensions [Citation Graph (, )][DBLP]


  60. Balanced Allocation on Graphs [Citation Graph (, )][DBLP]


  61. Lower bounds on Locality Sensitive Hashing [Citation Graph (, )][DBLP]


  62. Better Bounds for Frequency Moments in Random-Order Streams [Citation Graph (, )][DBLP]


  63. Revisiting the Examination Hypothesis with Query Specific Position Bias [Citation Graph (, )][DBLP]


  64. Lower Bounds on Near Neighbor Search via Metric Expansion [Citation Graph (, )][DBLP]


  65. Prediction strategies without loss [Citation Graph (, )][DBLP]


  66. Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002