☰

Rina Panigrahy, Ph.D. - Publications

Affiliations: 
2006 Stanford University, Palo Alto, CA 
Area:
Computer Science, Statistics, Operations Research
Tree Info Similar researchers PubMed Report error

30 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2014 Panigrahy R, Popat P. Optimal amortized regret in every interval Uncertainty in Artificial Intelligence - Proceedings of the 30th Conference, Uai 2014. 663-671.  0.33
2011 Sarma AD, Gollapudi S, Panigrahy R. Estimating page rank on graph streams Journal of the Acm. 58. DOI: 10.1145/1970392.1970397  0.39
2010 Aggarwal G, Feder T, Kenthapadi K, Khuller S, Panigrahy R, Thomas D, Zhu A. Achieving anonymity via clustering Acm Transactions On Algorithms. 6. DOI: 10.1145/1798596.1798602  0.706
2009 Alon N, Panigrahy R, Yekhanin S. Deterministic approximation algorithms for the nearest codeword problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 339-351. DOI: 10.1007/978-3-642-03685-9_26  0.401
2008 Panigrahy R. An improved algorithm finding nearest neighbor using Kd-trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 387-398. DOI: 10.1007/978-3-540-78773-0_34  0.306
2007 Carmo R, Feder T, Kohayakawa Y, Laber E, Motwani R, O'Callaghan L, Panigrahy R, Thomas D. Querying priced information in databases: The conjunctive case Acm Transactions On Algorithms. 3. DOI: 10.1145/1186810.1186819  0.754
2007 Motwani R, Naor A, Panigrahy R. Lower bounds on locality sensitive hashing Siam Journal On Discrete Mathematics. 21: 930-935. DOI: 10.1137/050646858  0.583
2007 Feder T, Motwani R, O'Callaghan L, Olston C, Panigrahy R. Computing shortest paths with uncertainty Journal of Algorithms. 62: 1-18. DOI: 10.1016/J.Jalgor.2004.07.005  0.731
2007 Motwani R, Panigrahy R, Xu Y. Estimating sum by weighted sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 53-64.  0.486
2007 Gollapudi S, Najork M, Panigrahy R. Using bloom filters to speed up HITS-like ranking algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4863: 195-201.  0.333
2006 Broder A, Fontura M, Josifovski V, Kumar R, Motwani R, Nabar S, Panigrahy R, Tomkins A, Xu Y. Estimating corpus size via queries International Conference On Information and Knowledge Management, Proceedings. 594-603. DOI: 10.1145/1183614.1183699  0.47
2006 Kenthapadi K, Panigrahy R. Balanced allocation on graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 434-443. DOI: 10.1145/1109557.1109606  0.668
2006 Motwani R, Panigrahy R, Xu Y. Fractional matching via balls-and-bins Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4110: 487-498.  0.525
2006 Kenthapadi K, Panigrahy R, Achlioptas D, Azar Y, Brightwell G, Cheriyan J, Gustedt J, Hell P, Iacono J, Kobourov S, Kolliopoulos S, Ladner R, Lewenstein M, Mahdian M, Plaxton G, et al. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms.  0.713
2005 Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Sahai A, Shelat A. The smallest grammar problem Ieee Transactions On Information Theory. 51: 2554-2576. DOI: 10.1109/Tit.2005.850116  0.695
2005 Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A. Anonymizing tables Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3363: 246-258. DOI: 10.1007/978-3-540-30570-5_17  0.755
2005 Aggarwal G, Feder T, Motwani R, Panigrahy R, Zhu A. Algorithms for the database layout problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3363: 189-203. DOI: 10.1007/978-3-540-30570-5_13  0.591
2004 Feder T, Motwani R, Panigrahy R, Seiden S, Van Stee R, Zhu A. Combining request scheduling with web caching Theoretical Computer Science. 324: 201-218. DOI: 10.1016/J.Tcs.2004.05.016  0.728
2004 Charikar M, Panigrahy R. Clustering to minimize the sum of cluster diameters Journal of Computer and System Sciences. 68: 417-441. DOI: 10.1016/J.Jcss.2003.07.0014  0.625
2003 Panigrahy R, Sharma S. Sorting and searching using ternary CAMs Ieee Micro. 23: 44-53. DOI: 10.1109/Mm.2003.1179897  0.444
2003 Datar M, Feder T, Gionis A, Motwani R, Panigrahy R. A combinatorial algorithm for MAX CSP Information Processing Letters. 85: 307-315. DOI: 10.1016/S0020-0190(02)00435-0  0.759
2003 Feder T, Meyerson A, Motwani R, O'Callaghan L, Panigrahy R. Representing graph metrics with fewest edges Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2607: 355-366.  0.497
2003 Charikar M, O'Callaghan L, Panigrahy R. Better streaming algorithms for clustering problems Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 30-39.  0.675
2002 Feder T, Motwani R, Panigrahy R, Zhu A. Web caching with request reordering Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 104-105.  0.63
2002 Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Rasala A, Sahai A, Shelat A. Approximating the smallest grammar: Kolmogorov complexity in natural models Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 792-801.  0.53
2002 Charikar M, Indyk P, Panigrahy R. New algorithms for subset query, partial match, orthogonal range searching, and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 451-462.  0.729
2000 Motwani R, Panigrahy R, Saraswat V, Ventkatasubramanian S. On the decidability of accessibility problems Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 306-315. DOI: 10.1145/335305.335341  0.522
2000 Feder T, Motwani R, Panigrahy R, Olston C, Widom J. Computing the median with uncertainty Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 602-607. DOI: 10.1137/S0097539701395668  0.565
1998 Panigrahy R, Vishwanathan S. An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem Journal of Algorithms. 27: 259-268.  0.35
1997 Kumar SR, Panigrahy R, Russell A, Sundaram R. A note on optical routing on trees Information Processing Letters. 62: 295-300. DOI: 10.1016/S0020-0190(97)00077-X  0.42
Show low-probability matches.