The SCEAS System
| |||||||

## Search the dblp DataBase
Ravi Kumar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Extracting Large-Scale Knowledge Bases from the Web.**[Citation Graph (2, 12)][DBLP] VLDB, 1999, pp:639-650 [Conf] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Trawling the Web for Emerging Cyber-Communities.**[Citation Graph (2, 0)][DBLP] Computer Networks, 1999, v:31, n:11-16, pp:1481-1493 [Journal] - Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**The Web as a Graph: Measurements, Models, and Methods.**[Citation Graph (1, 0)][DBLP] COCOON, 1999, pp:1-17 [Conf] - Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
**The Sketching Complexity of Pattern Matching.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:261-272 [Conf] - Miklós Ajtai, Ravi Kumar, D. Sivakumar
**An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem.**[Citation Graph (0, 0)][DBLP] CaLC, 2001, pp:1-3 [Conf] - 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] - Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The Complexity of Approximating the Entropy.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:17- [Conf] - Miklós Ajtai, Ravi Kumar, D. Sivakumar
**Sampling Short Lattice Vectors and the Closest Lattice Vector Problem.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:53-57 [Conf] - Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
**Information Theory Methods in Communication Complexity.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:93-102 [Conf] - Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
**On the Hardness of Approximating Multicut and Sparsest-Cut.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:144-153 [Conf] - Ravi Kumar, D. Sivakumar
**Proofs, Codes, and Polynomial-Time Reducibilities.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:46-53 [Conf] - Ravi Kumar, D. Sivakumar
**A Note on the Shortest Lattice Vector Problem.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:200-204 [Conf] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Approximating Latin Square Extensions.**[Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:280-289 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**On Learning Bounded-Width Branching Programs.**[Citation Graph (0, 0)][DBLP] COLT, 1995, pp:361-368 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**Learning Distributions from Random Walks.**[Citation Graph (0, 0)][DBLP] COLT, 1997, pp:243-249 [Conf] - Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
**Coding Constructions for Blacklisting Problems without Computational Assumptions.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1999, pp:609-623 [Conf] - Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih
**Image Indexing Using Color Correlograms.**[Citation Graph (0, 0)][DBLP] CVPR, 1997, pp:762-768 [Conf] - Ravi Kumar, David Liben-Nowell, Andrew Tomkins
**Navigating Low-Dimensional and Hierarchical Population Networks.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:480-491 [Conf] - Funda Ergün, Joe Kilian, Ravi Kumar
**A Note on the Limits of Collusion-Resistant Watermarks.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 1999, pp:140-149 [Conf] - Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
**Approximating Edit Distance Efficiently.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:550-559 [Conf] - Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
**An Information Statistics Approach to Data Stream and Communication Complexity.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:209-218 [Conf] - Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
**Testing Random Variables for Independence and Identity.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:442-451 [Conf] - Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
**Combinatorial feature selection problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:631-640 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**Approximate Checking of Polynomials and Functional Equations (extended abstract).**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:592-601 [Conf] - Ravi Kumar, D. Sivakumar
**Efficient Self-Testing/Self-Correction of Linear Recurrences.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:602-611 [Conf] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
**Random graph models for the web graph.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:57-65 [Conf] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Recommendation Systems: A Probabilistic Analysis.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:664-673 [Conf] - Ravi Kumar, D. Sivakumar
**On Self-Testing without the Generator Bottleneck.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1995, pp:248-262 [Conf] - Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar
**Checking Properties of Polynomials (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:203-213 [Conf] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Faster Algorithms for Optical Switch Configuration.**[Citation Graph (0, 0)][DBLP] ICC (3), 1997, pp:1320-1324 [Conf] - Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu
**Spatial Color Indexing and Applications.**[Citation Graph (0, 0)][DBLP] ICCV, 1998, pp:602-607 [Conf] - Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy
**Scalability Study of the KSR-1.**[Citation Graph (0, 0)][DBLP] ICPP, 1993, pp:237-240 [Conf] - Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins
**Variable latent semantic indexing.**[Citation Graph (0, 0)][DBLP] KDD, 2005, pp:13-21 [Conf] - Deepayan Chakrabarti, Ravi Kumar, Andrew Tomkins
**Evolutionary clustering.**[Citation Graph (0, 0)][DBLP] KDD, 2006, pp:554-560 [Conf] - Daniel Gruhl, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, Andrew Tomkins
**The predictive power of online chatter.**[Citation Graph (0, 0)][DBLP] KDD, 2005, pp:78-87 [Conf] - Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram
**Unweaving a web of documents.**[Citation Graph (0, 0)][DBLP] KDD, 2005, pp:574-579 [Conf] - Ravi Kumar, Uma Mahadevan, D. Sivakumar
**A graph-theoretic approach to extract storylines from search results.**[Citation Graph (0, 0)][DBLP] KDD, 2004, pp:216-225 [Conf] - Ravi Kumar, Jasmine Novak, Andrew Tomkins
**Structure and evolution of online social networks.**[Citation Graph (0, 0)][DBLP] KDD, 2006, pp:611-617 [Conf] - Ravi Kumar, Kunal Punera, Andrew Tomkins
**Hierarchical topic segmentation of websites.**[Citation Graph (0, 0)][DBLP] KDD, 2006, pp:257-266 [Conf] - Jing Huang, Ravi Kumar, Mandar Mitra
**Combining Supervised Learning with Color Correlograms for Content-Based Image Retrieval.**[Citation Graph (0, 0)][DBLP] ACM Multimedia, 1997, pp:325-334 [Conf] - Jing Huang, Ravi Kumar, Ramin Zabih
**An Automatic Hierarchical Image Classification Scheme.**[Citation Graph (0, 0)][DBLP] ACM Multimedia, 1998, pp:219-228 [Conf] - Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
**Selective private function evaluation with applications to private statistics.**[Citation Graph (0, 0)][DBLP] PODC, 2001, pp:293-304 [Conf] - Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
**Multi-structural databases.**[Citation Graph (0, 0)][DBLP] PODS, 2005, pp:184-195 [Conf] - Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
**Comparing and Aggregating Rankings with Ties.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:47-58 [Conf] - Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
**Programmable clustering.**[Citation Graph (0, 0)][DBLP] PODS, 2006, pp:348-354 [Conf] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
**The Web as a Graph.**[Citation Graph (0, 18)][DBLP] PODS, 2000, pp:1-10 [Conf] - Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
**Counting Distinct Elements in a Data Stream.**[Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:1-10 [Conf] - Ronald Fagin, Ravi Kumar, D. Sivakumar
**Efficient similarity search and classification via rank aggregation.**[Citation Graph (0, 0)][DBLP] SIGMOD Conference, 2003, pp:301-312 [Conf] - Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
**Reductions in streaming algorithms, with an application to counting triangles in graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:623-632 [Conf] - Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
**Minimizing Wirelength in Zero and Bounded Skew Clock Trees.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:177-184 [Conf] - Don Coppersmith, Ravi Kumar
**An improved data stream algorithm for frequency moments.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:151-156 [Conf] - Ronald Fagin, Ravi Kumar, D. Sivakumar
**Comparing top k lists.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:28-36 [Conf] - Ravi Kumar, Alexander Russell
**A note on the set systems used for broadcast encryption.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:470-471 [Conf] - Ravi Kumar, D. Sivakumar
**On polynomial approximation to the shortest lattice vector length.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:126-127 [Conf] - Ravi Kumar, D. Sivakumar
**Roundness Estimation via Random Sampling.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:603-612 [Conf] - Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram
**On Completing Latin Squares.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:524-535 [Conf] - Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
**Approximate counting of inversions in a data stream.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:370-379 [Conf] - Miklós Ajtai, Ravi Kumar, D. Sivakumar
**A sieve algorithm for the shortest lattice vector problem.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:601-610 [Conf] - Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
**Sampling algorithms: lower bounds and applications.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:266-275 [Conf] - Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
**Sublinear algorithms for testing monotone and unimodal distributions.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:381-390 [Conf] - Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The complexity of approximating entropy.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:678-687 [Conf] - Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**On targeting Markov segments.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:99-108 [Conf] - Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
**Spot-Checkers.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:259-268 [Conf] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**Fast Approximate PCPs.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:41-50 [Conf] - T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
**Cell-probe lower bounds for the partial match problem.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:667-672 [Conf] - T. S. Jayram, Ravi Kumar, D. Sivakumar
**Two applications of information complexity.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:673-682 [Conf] - Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
**Self-similarity in the Web.**[Citation Graph (0, 0)][DBLP] VLDB, 2001, pp:69-78 [Conf] - Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
**Efficient Implementation of Large-Scale Multi-Structural Databases.**[Citation Graph (0, 0)][DBLP] VLDB, 2005, pp:958-969 [Conf] - David Gibson, Ravi Kumar, Andrew Tomkins
**Discovering Large Dense Subgraphs in Massive Graphs.**[Citation Graph (0, 0)][DBLP] VLDB, 2005, pp:721-732 [Conf] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**On Semi-Automated Web Taxonomy Construction.**[Citation Graph (0, 0)][DBLP] WebDB, 2001, pp:91-96 [Conf] - Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins
**Sic transit gloria telae: towards an understanding of the web's decay.**[Citation Graph (0, 0)][DBLP] WWW, 2004, pp:328-337 [Conf] - Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
**Visualizing tags over time.**[Citation Graph (0, 0)][DBLP] WWW, 2006, pp:193-202 [Conf] - Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
**Rank aggregation methods for the Web.**[Citation Graph (0, 0)][DBLP] WWW, 2001, pp:613-622 [Conf] - Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson
**Searching the workplace web.**[Citation Graph (0, 0)][DBLP] WWW, 2003, pp:366-375 [Conf] - Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins
**Propagation of trust and distrust.**[Citation Graph (0, 0)][DBLP] WWW, 2004, pp:403-412 [Conf] - Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi Kumar
**Searching with context.**[Citation Graph (0, 0)][DBLP] WWW, 2006, pp:477-486 [Conf] - Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
**On the bursty evolution of blogspace.**[Citation Graph (0, 0)][DBLP] WWW, 2003, pp:568-576 [Conf] - Satish Kumar Singh, Shishir Kumar, G. S. Tomar, Ravi Kumar, G. K. Santhalia
**A Modified Framework of a Clustering Algorithm for Image Processing Applications.**[Citation Graph (0, 0)][DBLP] Asia International Conference on Modelling and Simulation, 2007, pp:434-437 [Conf] - Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Topic Distillation and Spectral Filtering.**[Citation Graph (0, 0)][DBLP] Artif. Intell. Rev., 1999, v:13, n:5-6, pp:409-435 [Journal] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Approximating Latin Square Extensions.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:2, pp:128-138 [Journal] - Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
**Structure and evolution of blogspace.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 2004, v:47, n:12, pp:35-39 [Journal] - Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
**On the Hardness of Approximating Multicut and Sparsest-Cut.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2006, v:15, n:2, pp:94-114 [Journal] - Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener
**Graph structure in the Web.**[Citation Graph (0, 0)][DBLP] Computer Networks, 2000, v:33, n:1-6, pp:309-320 [Journal] - Soumen Chakrabarti, Byron Dom, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon M. Kleinberg
**Mining the Web's Link Structure.**[Citation Graph (0, 0)][DBLP] IEEE Computer, 1999, v:32, n:8, pp:60-67 [Journal] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**The Web and Social Networks.**[Citation Graph (0, 0)][DBLP] IEEE Computer, 2002, v:35, n:11, pp:32-36 [Journal] - Raghu Ramakrishnan, Andrew Tomkins, Ravi Kumar
**Content, Metadata, and Behavioral Information: Directions for Yahoo! Research.**[Citation Graph (0, 0)][DBLP] IEEE Data Eng. Bull., 2006, v:29, n:4, pp:10-18 [Journal] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**Fast approximate probabilistically checkable proofs.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:189, n:2, pp:135-159 [Journal] - 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] - Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
**An information statistics approach to data stream and communication complexity.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:4, pp:702-732 [Journal] - Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
**Spot-Checkers.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:3, pp:717-751 [Journal] - T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
**Cell-probe lower bounds for the partial match problem.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:435-447 [Journal] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Recommendation Systems: A Probabilistic Analysis.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:63, n:1, pp:42-61 [Journal] - Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy
**Scalability Study of the KSR-1.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1996, v:22, n:5, pp:739-759 [Journal] - Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
**The Complexity of Approximating the Entropy.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:1, pp:132-150 [Journal] - Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
**Checking Approximate Computations of Polynomials and Functional Equations.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:2, pp:550-576 [Journal] - Funda Ergün, Ravi Kumar, D. Sivakumar
**Self-Testing without the Generator Bottleneck.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:29, n:5, pp:1630-1651 [Journal] - Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
**Minimizing Wirelength in Zero and Bounded Skew Clock Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:17, n:4, pp:582-595 [Journal] - Ronald Fagin, Ravi Kumar, D. Sivakumar
**Comparing Top k Lists.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:17, n:1, pp:134-160 [Journal] - Ravi Kumar, D. Sivakumar
**On Polynomial-Factor Approximations to the Shortest Lattice Vector Length.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:16, n:3, pp:422-425 [Journal] - Ravi Kumar, Matthieu Latapy
**Preface.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:355, n:1, pp:1-5 [Journal] - Ravi Kumar, D. Sivakumar
**On the unique shortest lattice vector problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:641-648 [Journal] - Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
**Self-similarity in the web.**[Citation Graph (0, 0)][DBLP] ACM Trans. Internet Techn., 2002, v:2, n:3, pp:205-223 [Journal] - Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
**Core algorithms in the CLEVER system.**[Citation Graph (0, 0)][DBLP] ACM Trans. Internet Techn., 2006, v:6, n:2, pp:131-152 [Journal] - Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
**On the Bursty Evolution of Blogspace.**[Citation Graph (0, 0)][DBLP] World Wide Web, 2005, v:8, n:2, pp:159-178 [Journal] - Ravi Kumar, Rina Panigrahy
**On Finding Frequent Elements in a Data Stream.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:584-595 [Conf] - Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii
**On threshold behavior in query incentive networks.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:66-74 [Conf] - Tanuja Bompada, Chi-Chao Chang, John Chen, Ravi Kumar, Rajesh Shenoy
**On the robustness of relevance measures with incomplete judgments.**[Citation Graph (0, 0)][DBLP] SIGIR, 2007, pp:359-366 [Conf] - Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
**Estimating the sortedness of a data stream.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:318-327 [Conf] - Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu 0002
**Deterministic Decentralized Search in Random Graphs.**[Citation Graph (0, 0)][DBLP] WAW, 2007, pp:187-194 [Conf] - Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christopher Olston, Sandeep Pandey, Andrew Tomkins
**The discoverability of the web.**[Citation Graph (0, 0)][DBLP] WWW, 2007, pp:421-430 [Conf] - Ravi Kumar, Jasmine Novak, Bo Pang, Andrew Tomkins
**On anonymizing query logs via token-based hashing.**[Citation Graph (0, 0)][DBLP] WWW, 2007, pp:629-638 [Conf] - Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
**Page-level template detection via isotonic smoothing.**[Citation Graph (0, 0)][DBLP] WWW, 2007, pp:61-70 [Conf] - Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew Tomkins
**Anchor-based proximity measures.**[Citation Graph (0, 0)][DBLP] WWW, 2007, pp:1131-1132 [Conf] - Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney
**Sampling Algorithms and Coresets for Lp Regression**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
**Visualizing tags over time.**[Citation Graph (0, 0)][DBLP] TWEB, 2007, v:1, n:2, pp:- [Journal] **Vanity fair: privacy in querylog bundles.**[Citation Graph (, )][DBLP]**"I know what you did last summer": query logs and user privacy.**[Citation Graph (, )][DBLP]**An analysis framework for search sequences.**[Citation Graph (, )][DBLP]**A translation model for matching reviews to objects.**[Citation Graph (, )][DBLP]**Modeling and Algorithmic Challenges in Online Social Networks.**[Citation Graph (, )][DBLP]**Models for the Compressible Web.**[Citation Graph (, )][DBLP]**Communication Lower Bounds Via the Chromatic Number.**[Citation Graph (, )][DBLP]**Sort Me If You Can: How to Sort Dynamic Data.**[Citation Graph (, )][DBLP]**Efficient Discovery of Authoritative Resources.**[Citation Graph (, )][DBLP]**Influence and correlation in social networks.**[Citation Graph (, )][DBLP]**Social networks: looking ahead.**[Citation Graph (, )][DBLP]**De-duping URLs via rewrite rules.**[Citation Graph (, )][DBLP]**Microscopic evolution of social networks.**[Citation Graph (, )][DBLP]**Generating succinct titles for web URLs.**[Citation Graph (, )][DBLP]**Mining web logs: applications and challenges.**[Citation Graph (, )][DBLP]**On compressing social networks.**[Citation Graph (, )][DBLP]**Optimizing web traffic via the media scheduling problem.**[Citation Graph (, )][DBLP]**Dynamics of conversations.**[Citation Graph (, )][DBLP]**Balanced allocation with succinct representation.**[Citation Graph (, )][DBLP]**For a few dollars less: Identifying review pages sans human labels.**[Citation Graph (, )][DBLP]**Mortal Multi-Armed Bandits.**[Citation Graph (, )][DBLP]**A web of concepts.**[Citation Graph (, )][DBLP]**Similarity caching.**[Citation Graph (, )][DBLP]**Approximation algorithms for co-clustering.**[Citation Graph (, )][DBLP]**ShatterPlots: Fast Tools for Mining Large Graphs.**[Citation Graph (, )][DBLP]**Optimizing query rewrites for keyword-based advertising.**[Citation Graph (, )][DBLP]**Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03).**[Citation Graph (, )][DBLP]**Pig latin: a not-so-foreign language for data processing.**[Citation Graph (, )][DBLP]**Sampling algorithms and coresets for ℓ**[Citation Graph (, )][DBLP]_{p}regression.**The hiring problem and Lake Wobegon strategies.**[Citation Graph (, )][DBLP]**Finding the Jaccard Median.**[Citation Graph (, )][DBLP]**A sparse Johnson: Lindenstrauss transform.**[Citation Graph (, )][DBLP]**Mechanism Design for Complexity-Constrained Bidders.**[Citation Graph (, )][DBLP]**Spatial variation in search engine queries.**[Citation Graph (, )][DBLP]**A graph-theoretic approach to webpage segmentation.**[Citation Graph (, )][DBLP]**Compressed web indexes.**[Citation Graph (, )][DBLP]**Nearest-neighbor caching for content-match applications.**[Citation Graph (, )][DBLP]**Quicklink selection for navigational query results.**[Citation Graph (, )][DBLP]**Generalized distances between rankings.**[Citation Graph (, )][DBLP]**Max-cover in map-reduce.**[Citation Graph (, )][DBLP]**A characterization of online browsing behavior.**[Citation Graph (, )][DBLP]**Stochastic models for tabbed browsing.**[Citation Graph (, )][DBLP]**Preferential behavior in online groups.**[Citation Graph (, )][DBLP]**Connectivity structure of bipartite graphs via the KNC-plot.**[Citation Graph (, )][DBLP]**Top-**[Citation Graph (, )][DBLP]*k*aggregation using intersections of ranked inputs.**Online social networks: modeling and mining: invited talk.**[Citation Graph (, )][DBLP]**Evolution of two-sided markets.**[Citation Graph (, )][DBLP]**Matching Reviews to Objects using a Language Model.**[Citation Graph (, )][DBLP]**A Sparse Johnson--Lindenstrauss Transform**[Citation Graph (, )][DBLP]**A Characterization of Online Search Behavior.**[Citation Graph (, )][DBLP]
Search in 0.011secs, Finished in 0.019secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |