| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Ravi Kumar Ronald Fagin , R. Guha , Ravi Kumar, Jasmine Novak , D. Sivakumar , Andrew Tomkins : Multi-Structural Databases. PODS 2005 Ziv Bar-Yossef , T. S. Jayram , Robert Krauthgamer , Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004 : 261-272 Ziv Bar-Yossef , T. S. Jayram , Robert Krauthgamer , Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004 : 550-559 Ravi Kumar, Uma Mahadevan , D. Sivakumar : A graph-theoretic approach to extract storylines from search results. KDD 2004 : 216-225 Ronald Fagin , Ravi Kumar, Mohammad Mahdian , D. Sivakumar , Erik Vee : Comparing and Aggregating Rankings with Ties. PODS 2004 : 47-58 Don Coppersmith , Ravi Kumar: An improved data stream algorithm for frequency moments. SODA 2004 : 151-156 Tugkan Batu , Ravi Kumar, Ronitt Rubinfeld : Sublinear algorithms for testing monotone and unimodal distributions. STOC 2004 : 381-390 Ziv Bar-Yossef , Andrei Z. Broder , Ravi Kumar, Andrew Tomkins : Sic transit gloria telae: towards an understanding of the web's decay. WWW 2004 : 328-337 R. Guha , Ravi Kumar, Prabhakar Raghavan , Andrew Tomkins : Propagation of trust and distrust. WWW 2004 : 403-412 Ravi Kumar, Jasmine Novak , Prabhakar Raghavan , Andrew Tomkins : Structure and evolution of blogspace. Commun. ACM 47 (12): 35-39 (2004) Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : Fast approximate probabilistically checkable proofs. Inf. Comput. 189 (2): 135-159 (2004) Ronald Fagin , Ravi Kumar, D. Sivakumar : Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003 : 301-312 Ronald Fagin , Ravi Kumar, D. Sivakumar : Comparing top k lists. SODA 2003 : 28-36 Ravi Kumar, Alexander Russell : A note on the set systems used for broadcast encryption. SODA 2003 : 470-471 T. S. Jayram , Subhash Khot , Ravi Kumar, Yuval Rabani : Cell-probe lower bounds for the partial match problem. STOC 2003 : 667-672 T. S. Jayram , Ravi Kumar, D. Sivakumar : Two applications of information complexity. STOC 2003 : 673-682 Ronald Fagin , Ravi Kumar, Kevin S. McCurley , Jasmine Novak , D. Sivakumar , John A. Tomlin , David P. Williamson : Searching the workplace web. WWW 2003 : 366-375 Ravi Kumar, Jasmine Novak , Prabhakar Raghavan , Andrew Tomkins : On the bursty evolution of blogspace. WWW 2003 : 568-576 Ravi Kumar, D. Sivakumar : On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discrete Math. 16 (3): 422-425 (2003) Ronald Fagin , Ravi Kumar, D. Sivakumar : Comparing Top k Lists. SIAM J. Discrete Math. 17 (1): 134-160 (2003) Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar, D. Sivakumar : An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002 : 209-218 Tugkan Batu , Sanjoy Dasgupta , Ravi Kumar, Ronitt Rubinfeld : The Complexity of Approximating the Entropy. IEEE Conference on Computational Complexity 2002 : 17 Miklós Ajtai , Ravi Kumar, D. Sivakumar : Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. IEEE Conference on Computational Complexity 2002 : 53-57 Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar, D. Sivakumar : Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002 : 93-102 Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar, D. Sivakumar , Luca Trevisan : Counting Distinct Elements in a Data Stream. RANDOM 2002 : 1-10 Ziv Bar-Yossef , Ravi Kumar, D. Sivakumar : Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002 : 623-632 Miklós Ajtai , T. S. Jayram , Ravi Kumar, D. Sivakumar : Approximate counting of inversions in a data stream. STOC 2002 : 370-379 Tugkan Batu , Sanjoy Dasgupta , Ravi Kumar, Ronitt Rubinfeld : The complexity of approximating entropy. STOC 2002 : 678-687 Stephen Dill , Ravi Kumar, Kevin S. McCurley , Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins : Self-similarity in the web. ACM Trans. Internet Techn. 2 (3): 205-223 (2002) Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : The Web and Social Networks. IEEE Computer 35 (11): 32-36 (2002) Miklós Ajtai , Ravi Kumar, D. Sivakumar : An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001 : 1-3 Tugkan Batu , Lance Fortnow , Eldar Fischer , Ravi Kumar, Ronitt Rubinfeld , Patrick White : Testing Random Variables for Independence and Identity. FOCS 2001 : 442-451 Ran Canetti , Yuval Ishai , Ravi Kumar, Michael K. Reiter , Ronitt Rubinfeld , Rebecca N. Wright : Selective private function evaluation with applications to private statistics. PODC 2001 : 293-304 Ravi Kumar, D. Sivakumar : On polynomial approximation to the shortest lattice vector length. SODA 2001 : 126-127 Ziv Bar-Yossef , Ravi Kumar, D. Sivakumar : Sampling algorithms: lower bounds and applications. STOC 2001 : 266-275 Miklós Ajtai , Ravi Kumar, D. Sivakumar : A sieve algorithm for the shortest lattice vector problem. STOC 2001 : 601-610 Stephen Dill , Ravi Kumar, Kevin S. McCurley , Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins : Self-similarity in the Web. VLDB 2001 : 69-78 Cynthia Dwork , Ravi Kumar, Moni Naor , D. Sivakumar : Rank aggregation methods for the Web. WWW 2001 : 613-622 Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : On Semi-Automated Web Taxonomy Construction. WebDB 2001 : 91-96 Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : Recommendation Systems: A Probabilistic Analysis. J. Comput. Syst. Sci. 63 (1): 42-61 (2001) Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : Checking Approximate Computations of Polynomials and Functional Equations. SIAM J. Comput. 31 (2): 550-576 (2001) Ravi Kumar, D. Sivakumar : On the unique shortest lattice vector problem. Theor. Comput. Sci. 255 (1-2): 641-648 (2001) Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins , Eli Upfal : Random graph models for the web graph. FOCS 2000 : 57-65 Moses Charikar , Venkatesan Guruswami , Ravi Kumar, Sridhar Rajagopalan , Amit Sahai : Combinatorial feature selection problems. FOCS 2000 : 631-640 Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar , Andrew Tomkins , Eli Upfal : The Web as a Graph. PODS 2000 : 1-10 Andrei Z. Broder , Ravi Kumar, Farzin Maghoul , Prabhakar Raghavan , Sridhar Rajagopalan , Raymie Stata , Andrew Tomkins , Janet L. Wiener : Graph structure in the Web. Computer Networks 33 (1-6): 309-320 (2000) Funda Ergün , Sampath Kannan , Ravi Kumar, Ronitt Rubinfeld , Mahesh Viswanathan : Spot-Checkers. J. Comput. Syst. Sci. 60 (3): 717-751 (2000) Funda Ergün , Ravi Kumar, D. Sivakumar : Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29 (5): 1630-1651 (2000) Jon M. Kleinberg , Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : The Web as a Graph: Measurements, Models, and Methods. COCOON 1999 : 1-17 Ravi Kumar, Sridhar Rajagopalan , Amit Sahai : Coding Constructions for Blacklisting Problems without Computational Assumptions. CRYPTO 1999 : 609-623 Funda Ergün , Joe Kilian , Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT 1999 : 140-149 Ravi Kumar, D. Sivakumar : A Note on the Shortest Lattice Vector Problem. IEEE Conference on Computational Complexity 1999 : 200-204 Ravi Kumar, D. Sivakumar : Proofs, Codes, and Polynomial-Time Reducibilities. IEEE Conference on Computational Complexity 1999 : 46-53 Moses Charikar , Jon M. Kleinberg , Ravi Kumar, Sridhar Rajagopalan , Amit Sahai , Andrew Tomkins : Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SODA 1999 : 177-184 Ravi Kumar, D. Sivakumar : Roundness Estimation via Random Sampling. SODA 1999 : 603-612 Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : Fast Approximate PCPs. STOC 1999 : 41-50 Moses Charikar , Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : On targeting Markov segments. STOC 1999 : 99-108 Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : Extracting Large-Scale Knowledge Bases from the Web. VLDB 1999 : 639-650 Ravi Kumar, Alexander Russell , Ravi Sundaram : Approximating Latin Square Extensions. Algorithmica 24 (2): 128-138 (1999) Soumen Chakrabarti , Byron Dom , David Gibson , Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : Topic Distillation and Spectral Filtering. Artif. Intell. Rev. 13 (5-6): 409-435 (1999) Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : Trawling the Web for Emerging Cyber-Communities. Computer Networks 31 (11-16): 1481-1493 (1999) Soumen Chakrabarti , Byron Dom , Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins , David Gibson , Jon M. Kleinberg : Mining the Web's Link Structure. IEEE Computer 32 (8): 60-67 (1999) Jing Huang , Ravi Kumar, Ramin Zabih : An Automatic Hierarchical Image Classification Scheme. ACM Multimedia 1998 : 219-228 Ravi Kumar, Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : Recommendation Systems: A Probabilistic Analysis. FOCS 1998 : 664-673 Jing Huang , Ravi Kumar, Mandar Mitra , Wei-Jing Zhu : Spatial Color Indexing and Applications. ICCV 1998 : 602-607 Funda Ergün , Sampath Kannan , Ravi Kumar, Ronitt Rubinfeld , Mahesh Viswanathan : Spot-Checkers. STOC 1998 : 259-268 Jing Huang , Ravi Kumar, Mandar Mitra : Combining Supervised Learning with Color Correlograms for Content-Based Image Retrieval. ACM Multimedia 1997 : 325-334 Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : Learning Distributions from Random Walks. COLT 1997 : 243-249 Jing Huang , Ravi Kumar, Mandar Mitra , Wei-Jing Zhu , Ramin Zabih : Image Indexing Using Color Correlograms. CVPR 1997 : 762-768 Bruno Codenotti , Funda Ergün , Peter Gemmell , Ravi Kumar: Checking Properties of Polynomials (Extended Abstract). ICALP 1997 : 203-213 Ravi Kumar, Alexander Russell , Ravi Sundaram : Faster Algorithms for Optical Switch Configuration. ICC (3) 1997 : 1320-1324 Ravi Kumar, Rina Panigrahy , Alexander Russell , Ravi Sundaram : A Note on Optical Routing on Trees. Inf. Process. Lett. 62 (6): 295-300 (1997) Ravi Kumar, Alexander Russell , Ravi Sundaram : Approximating Latin Square Extensions. COCOON 1996 : 280-289 Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : Approximate Checking of Polynomials and Functional Equations (extended abstract). FOCS 1996 : 592-601 Ravi Kumar, D. Sivakumar : Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996 : 602-611 Umakishore Ramachandran , Gautam Shah , Ravi Kumar, Jeyakumar Muthukumarasamy : Scalability Study of the KSR-1. Parallel Computing 22 (5): 739-759 (1996) Funda Ergün , Ravi Kumar, Ronitt Rubinfeld : On Learning Bounded-Width Branching Programs. COLT 1995 : 361-368 Ravi Kumar, D. Sivakumar : On Self-Testing without the Generator Bottleneck. FSTTCS 1995 : 248-262 Umakishore Ramachandran , Gautam Shah , Ravi Kumar, Jeyakumar Muthukumarasamy : Scalability Study of the KSR-1. ICPP 1993 : 237-240 1 [ 44 ] [ 49 ] [ 53 ] [ 57 ] 2 [ 45 ] [ 54 ] [ 55 ] [ 56 ] [ 59 ] [ 72 ] [ 77 ] [ 78 ] 3 [ 48 ] [ 52 ] [ 58 ] [ 73 ] 4 [ 34 ] [ 72 ] 5 [ 47 ] 6 [ 18 ] [ 20 ] 7 [ 23 ] [ 26 ] [ 36 ] 8 [ 10 ] 9 [ 74 ] 10 [ 52 ] [ 58 ] 11 [ 43 ] [ 51 ] 12 [ 18 ] [ 20 ] 13 [ 42 ] 14 [ 3 ] [ 6 ] [ 10 ] [ 12 ] [ 14 ] [ 24 ] [ 29 ] [ 32 ] [ 33 ] [ 39 ] [ 69 ] 15 [ 60 ] [ 63 ] [ 67 ] [ 68 ] [ 75 ] [ 79 ] 16 [ 48 ] 17 [ 48 ] 18 [ 10 ] 19 [ 18 ] [ 20 ] 20 [ 71 ] [ 79 ] 21 [ 36 ] 22 [ 11 ] [ 13 ] [ 15 ] [ 17 ] 23 [ 47 ] 24 [ 53 ] [ 55 ] [ 56 ] [ 59 ] [ 64 ] [ 65 ] [ 77 ] [ 78 ] 25 [ 14 ] [ 33 ] 26 [ 65 ] 27 [ 29 ] 28 [ 18 ] [ 26 ] [ 31 ] 29 [ 77 ] [ 78 ] 30 [ 34 ] 31 [ 76 ] 32 [ 75 ] 33 [ 43 ] [ 51 ] [ 63 ] 34 [ 11 ] [ 13 ] [ 15 ] 35 [ 1 ] [ 4 ] 36 [ 42 ] 37 [ 62 ] [ 63 ] [ 70 ] [ 79 ] 38 [ 8 ] 39 [ 65 ] 40 [ 16 ] [ 18 ] [ 19 ] [ 20 ] [ 22 ] [ 23 ] [ 31 ] [ 34 ] [ 35 ] [ 37 ] [ 40 ] [ 41 ] [ 50 ] [ 62 ] [ 70 ] [ 71 ] 41 [ 16 ] [ 18 ] [ 19 ] [ 20 ] [ 22 ] [ 23 ] [ 26 ] [ 30 ] [ 31 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 40 ] [ 41 ] [ 43 ] [ 50 ] [ 51 ] 42 [ 1 ] [ 4 ] 43 [ 47 ] 44 [ 3 ] [ 6 ] [ 12 ] [ 14 ] [ 24 ] [ 33 ] [ 39 ] [ 47 ] [ 48 ] [ 52 ] [ 58 ] [ 69 ] [ 73 ] 45 [ 7 ] [ 8 ] [ 9 ] [ 21 ] [ 66 ] 46 [ 26 ] [ 30 ] [ 36 ] 47 [ 1 ] [ 4 ] 48 [ 2 ] [ 5 ] [ 25 ] [ 27 ] [ 28 ] [ 32 ] [ 35 ] [ 37 ] [ 38 ] [ 42 ] [ 43 ] [ 44 ] [ 45 ] [ 46 ] [ 49 ] [ 51 ] [ 53 ] [ 54 ] [ 55 ] [ 56 ] [ 57 ] [ 59 ] [ 60 ] [ 61 ] [ 63 ] [ 64 ] [ 67 ] [ 68 ] [ 75 ] [ 76 ] [ 79 ] 49 [ 34 ] 50 [ 7 ] [ 8 ] [ 9 ] [ 21 ] 51 [ 16 ] [ 18 ] [ 19 ] [ 20 ] [ 22 ] [ 23 ] [ 26 ] [ 31 ] [ 34 ] [ 35 ] [ 37 ] [ 40 ] [ 41 ] [ 43 ] [ 50 ] [ 51 ] [ 62 ] [ 70 ] [ 71 ] [ 72 ] [ 79 ] 52 [ 63 ] 53 [ 55 ] 54 [ 35 ] [ 37 ] 55 [ 75 ] 56 [ 14 ] [ 33 ] 57 [ 48 ] 58 [ 34 ] 59 [ 63 ] 60 [ 47 ] 61 [ 11 ] [ 17 ] 62 [ 11 ] [ 15 ]  ©2005 Association for Computing Machinery |
