S. Ravi Kumar
List of publications from the DBLP Bibliography Server - FAQ
2010 | ||
---|---|---|
166 | Ravi Kumar, Yury Lifshits, Andrew Tomkins: Evolution of two-sided markets. WSDM 2010: 311-320 | |
2009 | ||
165 | Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins: A translation model for matching reviews to objects. CIKM 2009: 167-176 | |
164 | Qiaozhu Mei, Kristina Klinkner, Ravi Kumar, Andrew Tomkins: An analysis framework for search sequences. CIKM 2009: 1991-1994 | |
163 | Ravi Kumar: Modeling and Algorithmic Challenges in Online Social Networks. CPM 2009: 180 | |
162 | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan: Models for the Compressible Web. FOCS 2009: 331-340 | |
161 | Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal: Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) 2009: 339-350 | |
160 | Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan: On compressing social networks. KDD 2009: 219-228 | |
159 | Ravi Kumar: Mining web logs: applications and challenges. KDD 2009: 3-4 | |
158 | Lars Backstrom, Jon M. Kleinberg, Ravi Kumar: Optimizing web traffic via the media scheduling problem. KDD 2009: 89-98 | |
157 | Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu: A web of concepts. PODS 2009: 1-12 | |
156 | Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii: Similarity caching. PODS 2009: 127-136 | |
155 | Ana Paula Appel, Deepayan Chakrabarti, Christos Faloutsos, Ravi Kumar, Jure Leskovec, Andrew Tomkins: ShatterPlots: Fast Tools for Mining Large Graphs. SDM 2009: 802-813 | |
154 | Ravi Kumar, Mohammad Mahdian, Amin Sayedi: Mechanism Design for Complexity-Constrained Bidders. WINE 2009: 513-520 | |
153 | Ravi Kumar: Online social networks: modeling and mining: invited talk. WSDM 2009: 2 | |
152 | Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vassilvitskii: Top-k aggregation using intersections of ranked inputs. WSDM 2009: 222-231 | |
151 | Deepayan Chakrabarti, Ravi Kumar, Kunal Punera: Quicklink selection for navigational query results. WWW 2009: 391-400 | |
150 | Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii: Nearest-neighbor caching for content-match applications. WWW 2009: 441-450 | |
149 | Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan: Compressed web indexes. WWW 2009: 451-460 | |
148 | Ravi Kumar: Web Page Quality Metrics. Encyclopedia of Database Systems 2009: 3483-3485 | |
147 | Ravi Kumar, Andrew Tomkins: A Characterization of Online Search Behavior. IEEE Data Eng. Bull. 32(2): 3-11 (2009) | |
146 | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling Algorithms and Coresets for $\ellp Regression. SIAM J. Comput. 38(5): 2060-2078 (2009) | |
145 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The Hiring Problem and Lake Wobegon Strategies. SIAM J. Comput. 39(4): 1233-1255 (2009) | |
2008 | ||
144 | Ian Soboroff, Eugene Agichtein, Ravi Kumar: Proceeding of the 2008 ACM Workshop on Search in Social Media, SSM 2008, Napa Valley, California, USA, October 30, 2008 ACM 2008 | |
143 | Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Grant Wang: Optimizing query rewrites for keyword-based advertising. ACM Conference on Electronic Commerce 2008: 10-19 | |
142 | Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins: Vanity fair: privacy in querylog bundles. CIKM 2008: 853-862 | |
141 | Ravi Kumar, Kevin Lang, Cameron Marlow, Andrew Tomkins: Efficient Discovery of Authoritative Resources. ICDE 2008: 1495-1497 | |
140 | Ravi Kumar, Alexander Tuzhilin, Christos Faloutsos, David Jensen, Gueorgi Kossinets, Jure Leskovec, Andrew Tomkins: Social networks: looking ahead. KDD 2008: 1060 | |
139 | Anirban Dasgupta, Ravi Kumar, Amit Sasturkar: De-duping URLs via rewrite rules. KDD 2008: 186-194 | |
138 | Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew Tomkins: Microscopic evolution of social networks. KDD 2008: 462-470 | |
137 | Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian: Influence and correlation in social networks. KDD 2008: 7-15 | |
136 | Deepayan Chakrabarti, Ravi Kumar, Kunal Punera: Generating succinct titles for web URLs. KDD 2008: 79-87 | |
135 | Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal: Mortal Multi-Armed Bandits. NIPS 2008: 273-280 | |
134 | Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar: Approximation algorithms for co-clustering. PODS 2008: 201-210 | |
133 | Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, Andrew Tomkins: Pig latin: a not-so-foreign language for data processing. SIGMOD Conference 2008: 1099-1110 | |
132 | Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar: Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference 2008: 1375-1376 | |
131 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii: The hiring problem and Lake Wobegon strategies. SODA 2008: 1184-1193 | |
130 | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling algorithms and coresets for ℓp regression. SODA 2008: 932-941 | |
129 | Lars Backstrom, Ravi Kumar, Cameron Marlow, Jasmine Novak, Andrew Tomkins: Preferential behavior in online groups. WSDM 2008: 117-128 | |
128 | Ravi Kumar, Andrew Tomkins, Erik Vee: Connectivity structure of bipartite graphs via the KNC-plot. WSDM 2008: 129-138 | |
127 | Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasmine Novak: Spatial variation in search engine queries. WWW 2008: 357-366 | |
126 | Deepayan Chakrabarti, Ravi Kumar, Kunal Punera: A graph-theoretic approach to webpage segmentation. WWW 2008: 377-386 | |
125 | Jing Huang, Ravi Kumar: Directed Control of Discrete Event Systems for Safety and Nonblocking. IEEE T. Automation Science and Engineering 5(4): 620-629 (2008) | |
124 | Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Christopher Olston, Andrew Tomkins, Sergei Vassilvitskii: Relaxation in text search using taxonomies. PVLDB 1(1): 672-683 (2008) | |
123 | T. S. Jayram, Ravi Kumar, D. Sivakumar: The One-Way Communication Complexity of Hamming Distance. Theory of Computing 4(1): 129-135 (2008) | |
2007 | ||
122 | Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii: On threshold behavior in query incentive networks. ACM Conference on Electronic Commerce 2007: 66-74 | |
121 | Ravi Kumar, Rina Panigrahy: On Finding Frequent Elements in a Data Stream. APPROX-RANDOM 2007: 584-595 | |
120 | Satish Kumar Singh, Shishir Kumar, G. S. Tomar, Ravi Kumar, Gaurav Kumar Santhalia: A Modified Framework of a Clustering Algorithm for Image Processing Applications. Asia International Conference on Modelling and Simulation 2007: 434-437 | |
119 | Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins: "I know what you did last summer": query logs and user privacy. CIKM 2007: 909-914 | |
118 | Ravi Kumar, D. Sivakumar: Communication Lower Bounds Via the Chromatic Number. FSTTCS 2007: 228-240 | |
117 | Tanuja Bompada, Chi-Chao Chang, John Chen, Ravi Kumar, Rajesh Shenoy: On the robustness of relevance measures with incomplete judgments. SIGIR 2007: 359-366 | |
116 | Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Estimating the sortedness of a data stream. SODA 2007: 318-327 | |
115 | Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram: On Completing Latin Squares. STACS 2007: 524-535 | |
114 | Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu: Deterministic Decentralized Search in Random Graphs. WAW 2007: 187-194 | |
113 | Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew Tomkins: Anchor-based proximity measures. WWW 2007: 1131-1132 | |
112 | Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christopher Olston, Sandeep Pandey, Andrew Tomkins: The discoverability of the web. WWW 2007: 421-430 | |
111 | Deepayan Chakrabarti, Ravi Kumar, Kunal Punera: Page-level template detection via isotonic smoothing. WWW 2007: 61-70 | |
110 | Ravi Kumar, Jasmine Novak, Bo Pang, Andrew Tomkins: On anonymizing query logs via token-based hashing. WWW 2007: 629-638 | |
109 | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling Algorithms and Coresets for Lp Regression CoRR abs/0707.1714: (2007) | |
108 | André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar: Finding (Short) Paths in Social Networks. Internet Mathematics 3(2): (2007) | |
107 | Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins: Visualizing tags over time. TWEB 1(2): (2007) | |
2006 | ||
106 | Andrei 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 | |
105 | Ravi Kumar, David Liben-Nowell, Andrew Tomkins: Navigating Low-Dimensional and Hierarchical Population Networks. ESA 2006: 480-491 | |
104 | Ravi Kumar, Kunal Punera, Andrew Tomkins: Hierarchical topic segmentation of websites. KDD 2006: 257-266 | |
103 | Deepayan Chakrabarti, Ravi Kumar, Andrew Tomkins: Evolutionary clustering. KDD 2006: 554-560 | |
102 | Ravi Kumar, Jasmine Novak, Andrew Tomkins: Structure and evolution of online social networks. KDD 2006: 611-617 | |
101 | Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar: Programmable clustering. PODS 2006: 348-354 | |
100 | Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins: Visualizing tags over time. WWW 2006: 193-202 | |
99 | Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi Kumar: Searching with context. WWW 2006: 477-486 | |
98 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Core algorithms in the CLEVER system. ACM Trans. Internet Techn. 6(2): 131-152 (2006) | |
97 | Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar: On the Hardness of Approximating Multicut and Sparsest-Cut. Computational Complexity 15(2): 94-114 (2006) | |
96 | Raghu Ramakrishnan, Andrew Tomkins, Ravi Kumar: Content, Metadata, and Behavioral Information: Directions for Yahoo! Research. IEEE Data Eng. Bull. 29(4): 10-18 (2006) | |
95 | Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing Partial Rankings. SIAM J. Discrete Math. 20(3): 628-648 (2006) | |
94 | Ravi Kumar, Matthieu Latapy: Preface. Theor. Comput. Sci. 355(1): 1-5 (2006) | |
2005 | ||
93 | Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar: On the Hardness of Approximating Multicut and Sparsest-Cut. IEEE Conference on Computational Complexity 2005: 144-153 | |
92 | Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins: Variable latent semantic indexing. KDD 2005: 13-21 | |
91 | Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram: Unweaving a web of documents. KDD 2005: 574-579 | |
90 | Daniel Gruhl, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, Andrew Tomkins: The predictive power of online chatter. KDD 2005: 78-87 | |
89 | Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins: Multi-structural databases. PODS 2005: 184-195 | |
88 | David Gibson, Ravi Kumar, Andrew Tomkins: Discovering Large Dense Subgraphs in Massive Graphs. VLDB 2005: 721-732 | |
87 | Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins: Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB 2005: 958-969 | |
86 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld: The Complexity of Approximating the Entropy. SIAM J. Comput. 35(1): 132-150 (2005) | |
85 | Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins: On the Bursty Evolution of Blogspace. World Wide Web 8(2): 159-178 (2005) | |
2004 | ||
84 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: The Sketching Complexity of Pattern Matching. APPROX-RANDOM 2004: 261-272 | |
83 | Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar: Approximating Edit Distance Efficiently. FOCS 2004: 550-559 | |
82 | Ravi Kumar, Uma Mahadevan, D. Sivakumar: A graph-theoretic approach to extract storylines from search results. KDD 2004: 216-225 | |
81 | Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 | |
80 | Don Coppersmith, Ravi Kumar: An improved data stream algorithm for frequency moments. SODA 2004: 151-156 | |
79 | Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld: Sublinear algorithms for testing monotone and unimodal distributions. STOC 2004: 381-390 | |
78 | 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 | |
77 | Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins: Propagation of trust and distrust. WWW 2004: 403-412 | |
76 | Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins: Structure and evolution of blogspace. Commun. ACM 47(12): 35-39 (2004) | |
75 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast approximate probabilistically checkable proofs. Inf. Comput. 189(2): 135-159 (2004) | |
74 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4): 702-732 (2004) | |
73 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004) | |
72 | Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins: Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SIAM J. Discrete Math. 17(4): 582-595 (2004) | |
2003 | ||
71 | Ronald Fagin, Ravi Kumar, D. Sivakumar: Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003: 301-312 | |
70 | Ronald Fagin, Ravi Kumar, D. Sivakumar: Comparing top k lists. SODA 2003: 28-36 | |
69 | Ravi Kumar, Alexander Russell: A note on the set systems used for broadcast encryption. SODA 2003: 470-471 | |
68 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672 | |
67 | T. S. Jayram, Ravi Kumar, D. Sivakumar: Two applications of information complexity. STOC 2003: 673-682 | |
66 | 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 | |
65 | Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins: On the bursty evolution of blogspace. WWW 2003: 568-576 | |
64 | Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar: Link Evolution: Analysis and Algorithms. Internet Mathematics 1(3): (2003) | |
63 | Ravi Kumar, D. Sivakumar: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discrete Math. 16(3): 422-425 (2003) | |
62 | Ronald Fagin, Ravi Kumar, D. Sivakumar: Comparing Top k Lists. SIAM J. Discrete Math. 17(1): 134-160 (2003) | |
61 | Ravi Kumar, Ronitt Rubinfeld: Algorithms column: sublinear time algorithms. SIGACT News 34(4): 57-67 (2003) | |
2002 | ||
60 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 | |
59 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld: The Complexity of Approximating the Entropy. IEEE Conference on Computational Complexity 2002: 17 | |
58 | 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 | |
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 | |
56 | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 | |
55 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 | |
54 | Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar: Approximate counting of inversions in a data stream. STOC 2002: 370-379 | |
53 | Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld: The complexity of approximating entropy. STOC 2002: 678-687 | |
52 | 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) | |
51 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: The Web and Social Networks. IEEE Computer 35(11): 32-36 (2002) | |
2001 | ||
50 | Miklós Ajtai, Ravi Kumar, D. Sivakumar: An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001: 1-3 | |
49 | Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White: Testing Random Variables for Independence and Identity. FOCS 2001: 442-451 | |
48 | 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 | |
47 | Ravi Kumar, D. Sivakumar: On polynomial approximation to the shortest lattice vector length. SODA 2001: 126-127 | |
46 | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar: Sampling algorithms: lower bounds and applications. STOC 2001: 266-275 | |
45 | Miklós Ajtai, Ravi Kumar, D. Sivakumar: A sieve algorithm for the shortest lattice vector problem. STOC 2001: 601-610 | |
44 | Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins: Self-similarity in the Web. VLDB 2001: 69-78 | |
43 | Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar: Rank aggregation methods for the Web. WWW 2001: 613-622 | |
42 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: On Semi-Automated Web Taxonomy Construction. WebDB 2001: 91-96 | |
41 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Recommendation Systems: A Probabilistic Analysis. J. Comput. Syst. Sci. 63(1): 42-61 (2001) | |
40 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Checking Approximate Computations of Polynomials and Functional Equations. SIAM J. Comput. 31(2): 550-576 (2001) | |
39 | Ravi Kumar, D. Sivakumar: On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2): 641-648 (2001) | |
2000 | ||
38 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: Random graph models for the web graph. FOCS 2000: 57-65 | |
37 | Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai: Combinatorial feature selection problems. FOCS 2000: 631-640 | |
36 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: The Web as a Graph. PODS 2000: 1-10 | |
35 | 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) | |
34 | Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. J. Comput. Syst. Sci. 60(3): 717-751 (2000) | |
33 | Funda Ergün, Ravi Kumar, D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000) | |
1999 | ||
32 | Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: The Web as a Graph: Measurements, Models, and Methods. COCOON 1999: 1-17 | |
31 | Ravi Kumar, Sridhar Rajagopalan, Amit Sahai: Coding Constructions for Blacklisting Problems without Computational Assumptions. CRYPTO 1999: 609-623 | |
30 | Funda Ergün, Joe Kilian, Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks. EUROCRYPT 1999: 140-149 | |
29 | Ravi Kumar, D. Sivakumar: A Note on the Shortest Lattice Vector Problem. IEEE Conference on Computational Complexity 1999: 200-204 | |
28 | Ravi Kumar, D. Sivakumar: Proofs, Codes, and Polynomial-Time Reducibilities. IEEE Conference on Computational Complexity 1999: 46-53 | |
27 | 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 | |
26 | Ravi Kumar, D. Sivakumar: Roundness Estimation via Random Sampling. SODA 1999: 603-612 | |
25 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Fast Approximate PCPs. STOC 1999: 41-50 | |
24 | Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: On targeting Markov segments. STOC 1999: 99-108 | |
23 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Extracting Large-Scale Knowledge Bases from the Web. VLDB 1999: 639-650 | |
22 | Ravi Kumar, Alexander Russell, Ravi Sundaram: Approximating Latin Square Extensions. Algorithmica 24(2): 128-138 (1999) | |
21 | 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) | |
20 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Trawling the Web for Emerging Cyber-Communities. Computer Networks 31(11-16): 1481-1493 (1999) | |
19 | 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) | |
18 | Jing Huang, S. Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih: Spatial Color Indexing and Applications. International Journal of Computer Vision 35(3): 245-268 (1999) | |
1998 | ||
17 | Jing Huang, Ravi Kumar, Ramin Zabih: An Automatic Hierarchical Image Classification Scheme. ACM Multimedia 1998: 219-228 | |
16 | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: Recommendation Systems: A Probabilistic Analysis. FOCS 1998: 664-673 | |
15 | Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu: Spatial Color Indexing and Applications. ICCV 1998: 602-607 | |
14 | Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan: Spot-Checkers. STOC 1998: 259-268 | |
1997 | ||
13 | Jing Huang, Ravi Kumar, Mandar Mitra: Combining Supervised Learning with Color Correlograms for Content-Based Image Retrieval. ACM Multimedia 1997: 325-334 | |
12 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Learning Distributions from Random Walks. COLT 1997: 243-249 | |
11 | Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih: Image Indexing Using Color Correlograms. CVPR 1997: 762-768 | |
10 | Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar: Checking Properties of Polynomials (Extended Abstract). ICALP 1997: 203-213 | |
9 | Ravi Kumar, Alexander Russell, Ravi Sundaram: Faster Algorithms for Optical Switch Configuration. ICC (3) 1997: 1320-1324 | |
8 | Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram: A Note on Optical Routing on Trees. Inf. Process. Lett. 62(6): 295-300 (1997) | |
1996 | ||
7 | Ravi Kumar, Alexander Russell, Ravi Sundaram: Approximating Latin Square Extensions. COCOON 1996: 280-289 | |
6 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: Approximate Checking of Polynomials and Functional Equations (extended abstract). FOCS 1996: 592-601 | |
5 | Ravi Kumar, D. Sivakumar: Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996: 602-611 | |
4 | Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy: Scalability Study of the KSR-1. Parallel Computing 22(5): 739-759 (1996) | |
1995 | ||
3 | Funda Ergün, Ravi Kumar, Ronitt Rubinfeld: On Learning Bounded-Width Branching Programs. COLT 1995: 361-368 | |
2 | Ravi Kumar, D. Sivakumar: On Self-Testing without the Generator Bottleneck. FSTTCS 1995: 248-262 | |
1993 | ||
1 | Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy: Scalability Study of the KSR-1. ICPP 1993: 237-240 |