Ravi Kumar

Loading Google Thumbnails...
2012
189LSH-preserving functions and their applications. Flavio Chierichetti, Ravi Kumar. SODA 2012, 1078-1094. Web SearchBibTeXDownload
2011
188Search in the Lost Sense of ``Query'': Question Formulation in Web Search Queries and its Temporal Changes. Bo Pang, Ravi Kumar. ACL (Short Papers) 2011, 135-140. Web SearchBibTeXDownload
187Hiring a secretary from a poset. Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii, Andrea Vattani. ACM Conference on Electronic Commerce 2011, 39-48. Web SearchBibTeXDownload
186Markov Layout. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. FOCS 2011, 492-501. Web SearchBibTeXDownload
185Cross-Validation and Mean-Square Stability. Satyen Kale, Ravi Kumar, Sergei Vassilvitskii. ICS 2011, 487-495. Web SearchBibTeXDownload
184Fast locality-sensitive hashing. Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. KDD 2011, 1073-1081. Web SearchBibTeXDownload
183Sampling hidden objects using nearest-neighbor oracles. Nilesh N. Dalvi, Ravi Kumar, Ashwin Machanavajjhala, Vibhor Rastogi. KDD 2011, 1325-1333. Web SearchBibTeXDownload
182Automatic Wrappers for Large Scale Web Extraction. Nilesh N. Dalvi, Ravi Kumar, Mohamed A. Soliman. PVLDB (4): 219-230 (2011). Web SearchBibTeXDownload
181On scheduling in map-reduce and flow-shops. Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. SPAA 2011, 289-298. Web SearchBibTeXDownload
180Sorting and selection on dynamic data. Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal. Theor. Comput. Sci. (412): 2564-2576 (2011). Web SearchBibTeXDownload
179Optimizing two-dimensional search results presentation. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. WSDM 2011, 257-266. Web SearchBibTeXDownload
178An algorithmic treatment of strong queries. Ravi Kumar, Silvio Lattanzi, Prabhakar Raghavan. WSDM 2011, 775-784. Web SearchBibTeXDownload
2010
177Design of input shapers using modal cost for multi-mode systems. Ravi Kumar, Tarunraj Singh. Automatica (46): 598-604 (2010). Web SearchBibTeXDownload
176Performance of Dynamic MIMO Systems in Presence of Nakagami Fading Channel. Ravi Kumar, Rajiv Saxena, Abhay Sah, Saroj Gupta, Tapesh Chandgothia. CICSyN 2010, 369-372. Web SearchBibTeXDownload
175A Sparse Johnson--Lindenstrauss Transform. Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. CoRR (abs/1004.4240) (2010). Web SearchBibTeXDownload
174Mining RBAC Roles under Cardinality Constraint. Ravi Kumar, Shamik Sural, Arobinda Gupta. ICISS 2010, 171-185. Web SearchBibTeXDownload
173Balanced allocation with succinct representation. Saeed Alaei, Ravi Kumar, Azarakhsh Malekian, Erik Vee. KDD 2010, 523-532. Web SearchBibTeXDownload
172Dynamics of conversations. Ravi Kumar, Mohammad Mahdian, Mary McGlohon. KDD 2010, 553-562. Web SearchBibTeXDownload
171Finding the Jaccard Median. Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii. SODA 2010, 293-311. Web SearchBibTeXDownload
170A sparse Johnson: Lindenstrauss transform. Anirban Dasgupta, Ravi Kumar, Tamás Sarlós. STOC 2010, 341-350. Web SearchBibTeXDownload
169Evolution of two-sided markets. Ravi Kumar, Yury Lifshits, Andrew Tomkins. WSDM 2010, 311-320. Web SearchBibTeXDownload
168Max-cover in map-reduce. Flavio Chierichetti, Ravi Kumar, Andrew Tomkins. WWW 2010, 231-240. Web SearchBibTeXDownload
167A characterization of online browsing behavior. Ravi Kumar, Andrew Tomkins. WWW 2010, 561-570. Web SearchBibTeXDownload
166Stochastic models for tabbed browsing. Flavio Chierichetti, Ravi Kumar, Andrew Tomkins. WWW 2010, 241-250. Web SearchBibTeXDownload
165Generalized distances between rankings. Ravi Kumar, Sergei Vassilvitskii. WWW 2010, 571-580. Web SearchBibTeXDownload
2009
164A translation model for matching reviews to objects. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins. CIKM 2009, 167-176. Cited by 2Web SearchBibTeXDownload
163An analysis framework for search sequences. Qiaozhu Mei, Kristina Klinkner, Ravi Kumar, Andrew Tomkins. CIKM 2009, 1991-1994. Web SearchBibTeXDownload
162Modeling and Algorithmic Challenges in Online Social Networks. Ravi Kumar. CPM 2009, 180. Web SearchBibTeXDownload
161Matching Reviews to Objects using a Language Model. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Andrew Tomkins. EMNLP 2009, 609-618. Web SearchBibTeXDownload
160Web Page Quality Metrics. Ravi Kumar. Encyclopedia of Database Systems 2009, 3483-3485. Web SearchBibTeXDownload
159Models for the Compressible Web. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan. FOCS 2009, 331-340. Web SearchBibTeXDownload
158For a few dollars less: Identifying review pages sans human labels. Luciano Barbosa, Ravi Kumar, Bo Pang, Andrew Tomkins. HLT-NAACL 2009, 494-502. Web SearchBibTeXDownload
157Sort Me If You Can: How to Sort Dynamic Data. Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal. ICALP (2) 2009, 339-350. Web SearchBibTeXDownload
156A Characterization of Online Search Behavior. Ravi Kumar, Andrew Tomkins. IEEE Data Eng. Bull. (32): 3-11 (2009). Web SearchBibTeXDownload
155On compressing social networks. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan. KDD 2009, 219-228. Cited by 5Web SearchBibTeXDownload
154Optimizing web traffic via the media scheduling problem. Lars Backstrom, Jon M. Kleinberg, Ravi Kumar. KDD 2009, 89-98. Web SearchBibTeXDownload
153Mining web logs: applications and challenges. Ravi Kumar. KDD 2009, 3-4. Web SearchBibTeXDownload
152A web of concepts. Nilesh N. Dalvi, Ravi Kumar, Bo Pang, Raghu Ramakrishnan, Andrew Tomkins, Philip Bohannon, Sathiya Keerthi, Srujana Merugu. PODS 2009, 1-12. Web SearchBibTeXDownload
151Similarity caching. Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii. PODS 2009, 127-136. Web SearchBibTeXDownload
150ShatterPlots: Fast Tools for Mining Large Graphs. Ana Paula Appel, Deepayan Chakrabarti, Christos Faloutsos, Ravi Kumar, Jure Leskovec, Andrew Tomkins. SDM 2009, 802-813. Cited by 2Web SearchBibTeXDownload
149The Hiring Problem and Lake Wobegon Strategies. Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii. SIAM J. Comput. (39): 1233-1255 (2009). Web SearchBibTeXDownload
148Sampling Algorithms and Coresets for $\\ellp Regression. Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney. SIAM J. Comput. (38): 2060-2078 (2009). Web SearchBibTeXDownload
147Mechanism Design for Complexity-Constrained Bidders. Ravi Kumar, Mohammad Mahdian, Amin Sayedi. WINE 2009, 513-520. Web SearchBibTeXDownload
146Online social networks: modeling and mining: invited talk. Ravi Kumar. WSDM 2009, 2. Web SearchBibTeXDownload
145Top-k aggregation using intersections of ranked inputs. Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vassilvitskii. WSDM 2009, 222-231. Web SearchBibTeXDownload
144Compressed web indexes. Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan. WWW 2009, 451-460. Web SearchBibTeXDownload
143Quicklink selection for navigational query results. Deepayan Chakrabarti, Ravi Kumar, Kunal Punera. WWW 2009, 391-400. Web SearchBibTeXDownload
142Nearest-neighbor caching for content-match applications. Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii. WWW 2009, 441-450. Web SearchBibTeXDownload
2008
141Optimizing query rewrites for keyword-based advertising. Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Grant Wang. ACM Conference on Electronic Commerce 2008, 10-19. Web SearchBibTeXDownload
140Vanity fair: privacy in querylog bundles. Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins. CIKM 2008, 853-862. Cited by 1Web SearchBibTeXDownload
139Efficient Discovery of Authoritative Resources. Ravi Kumar, Kevin Lang, Cameron Marlow, Andrew Tomkins. ICDE 2008, 1495-1497. Web SearchBibTeXDownload
138Directed Control of Discrete Event Systems for Safety and Nonblocking. Jing Huang, Ravi Kumar. IEEE T. Automation Science and Engineering (5): 620-629 (2008). Web SearchBibTeXDownload
137Deterministic Decentralized Search in Random Graphs. Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu. Internet Mathematics (5): 141-154 (2008). Web SearchBibTeXDownload
136Social networks: looking ahead. Ravi Kumar, Alexander Tuzhilin, Christos Faloutsos, David Jensen, Gueorgi Kossinets, Jure Leskovec, Andrew Tomkins. KDD 2008, 1060. Cited by 1Web SearchBibTeXDownload
135Generating succinct titles for web URLs. Deepayan Chakrabarti, Ravi Kumar, Kunal Punera. KDD 2008, 79-87. Web SearchBibTeXDownload
134Influence and correlation in social networks. Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian. KDD 2008, 7-15. Web SearchBibTeXDownload
133De-duping URLs via rewrite rules. Anirban Dasgupta, Ravi Kumar, Amit Sasturkar. KDD 2008, 186-194. Web SearchBibTeXDownload
132Microscopic evolution of social networks. Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew Tomkins. KDD 2008, 462-470. Cited by 44Web SearchBibTeXDownload
131Mortal Multi-Armed Bandits. Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, Eli Upfal. NIPS 2008, 273-280. Web SearchBibTeXDownload
130Approximation algorithms for co-clustering. Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar. PODS 2008, 201-210. Web SearchBibTeXDownload
129Relaxation in text search using taxonomies. Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Christopher Olston, Andrew Tomkins, Sergei Vassilvitskii. PVLDB (1): 672-683 (2008). Cited by 4Web SearchBibTeXDownload
128Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar. SIGMOD Conference 2008, 1375-1376. Web SearchBibTeXDownload
127Pig latin: a not-so-foreign language for data processing. Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, Andrew Tomkins. SIGMOD Conference 2008, 1099-1110. Cited by 124Web SearchBibTeXDownload
126The hiring problem and Lake Wobegon strategies. Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii. SODA 2008, 1184-1193. Web SearchBibTeXDownload
125Sampling algorithms and coresets for ℓp regression. Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney. SODA 2008, 932-941. Web SearchBibTeXDownload
124The One-Way Communication Complexity of Hamming Distance. T. S. Jayram, Ravi Kumar, D. Sivakumar. Theory of Computing (4): 129-135 (2008). Cited by 5Web SearchBibTeXDownload
123Connectivity structure of bipartite graphs via the KNC-plot. Ravi Kumar, Andrew Tomkins, Erik Vee. WSDM 2008, 129-138. Cited by 3Web SearchBibTeXDownload
122Preferential behavior in online groups. Lars Backstrom, Ravi Kumar, Cameron Marlow, Jasmine Novak, Andrew Tomkins. WSDM 2008, 117-128. Cited by 9Web SearchBibTeXDownload
121Spatial variation in search engine queries. Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasmine Novak. WWW 2008, 357-366. Web SearchBibTeXDownload
120A graph-theoretic approach to webpage segmentation. Deepayan Chakrabarti, Ravi Kumar, Kunal Punera. WWW 2008, 377-386. Web SearchBibTeXDownload
2007
119On threshold behavior in query incentive networks. Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii. ACM Conference on Electronic Commerce 2007, 66-74. Web SearchBibTeXDownload
118On Finding Frequent Elements in a Data Stream. Ravi Kumar, Rina Panigrahy. APPROX-RANDOM 2007, 584-595. Web SearchBibTeXDownload
117A Modified Framework of a Clustering Algorithm for Image Processing Applications. Satish Kumar Singh, Shishir Kumar, G. S. Tomar, Ravi Kumar, Gaurav Kumar Santhalia. Asia International Conference on Modelling and Simulation 2007, 434-437. Web SearchBibTeXDownload
116"I know what you did last summer": query logs and user privacy. Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins. CIKM 2007, 909-914. Cited by 14Web SearchBibTeXDownload
115Sampling Algorithms and Coresets for Lp Regression. Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney. CoRR (abs/0707.1714) (2007). Web SearchBibTeXDownload
114Communication Lower Bounds Via the Chromatic Number. Ravi Kumar, D. Sivakumar. FSTTCS 2007, 228-240. Web SearchBibTeXDownload
113Finding (Short) Paths in Social Networks. André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar. Internet Mathematics (3) (2007). Web SearchBibTeX
112On the robustness of relevance measures with incomplete judgments. Tanuja Bompada, Chi-Chao Chang, John Chen, Ravi Kumar, Rajesh Shenoy. SIGIR 2007, 359-366. Web SearchBibTeXDownload
111Estimating the sortedness of a data stream. Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. SODA 2007, 318-327. Web SearchBibTeXDownload
110On Completing Latin Squares. Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram. STACS 2007, 524-535. Web SearchBibTeXDownload
109Visualizing tags over time. Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. TWEB (1) (2007). Cited by 145Web SearchBibTeXDownload
108Deterministic Decentralized Search in Random Graphs. Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu. WAW 2007, 187-194. Web SearchBibTeXDownload
107The discoverability of the web. Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christopher Olston, Sandeep Pandey, Andrew Tomkins. WWW 2007, 421-430. Cited by 19Web SearchBibTeXDownload
106On anonymizing query logs via token-based hashing. Ravi Kumar, Jasmine Novak, Bo Pang, Andrew Tomkins. WWW 2007, 629-638. Cited by 29Web SearchBibTeXDownload
105Page-level template detection via isotonic smoothing. Deepayan Chakrabarti, Ravi Kumar, Kunal Punera. WWW 2007, 61-70. Web SearchBibTeXDownload
104Anchor-based proximity measures. Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew Tomkins. WWW 2007, 1131-1132. Cited by 2Web SearchBibTeXDownload
2006
103Core algorithms in the CLEVER system. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. ACM Trans. Internet Techn. (6): 131-152 (2006). Cited by 6Web SearchBibTeXDownload
102Estimating corpus size via queries. Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu. CIKM 2006, 594-603. Cited by 21Web SearchBibTeXDownload
101On the Hardness of Approximating Multicut and Sparsest-Cut. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. Computational Complexity (15): 94-114 (2006). Cited by 74Web SearchBibTeXDownload
100Navigating Low-Dimensional and Hierarchical Population Networks. Ravi Kumar, David Liben-Nowell, Andrew Tomkins. ESA 2006, 480-491. Cited by 11Web SearchBibTeXDownload
99Content, Metadata, and Behavioral Information: Directions for Yahoo! Research. Raghu Ramakrishnan, Andrew Tomkins, Ravi Kumar. IEEE Data Eng. Bull. (29): 10-18 (2006). Web SearchBibTeXDownload
98Hierarchical topic segmentation of websites. Ravi Kumar, Kunal Punera, Andrew Tomkins. KDD 2006, 257-266. Cited by 6Web SearchBibTeXDownload
97Evolutionary clustering. Deepayan Chakrabarti, Ravi Kumar, Andrew Tomkins. KDD 2006, 554-560. Cited by 53Web SearchBibTeXDownload
96Structure and evolution of online social networks. Ravi Kumar, Jasmine Novak, Andrew Tomkins. KDD 2006, 611-617. Cited by 209Web SearchBibTeXDownload
95Programmable clustering. Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar. PODS 2006, 348-354. Cited by 2Web SearchBibTeXDownload
94Comparing Partial Rankings. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee. SIAM J. Discrete Math. (20): 628-648 (2006). Cited by 23Web SearchBibTeXDownload
93Visualizing tags over time. Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. WWW 2006, 193-202. Cited by 145Web SearchBibTeXDownload
92Searching with context. Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi Kumar. WWW 2006, 477-486. Web SearchBibTeXDownload
2005
91On the Hardness of Approximating Multicut and Sparsest-Cut. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. IEEE Conference on Computational Complexity 2005, 144-153. Cited by 74Web SearchBibTeXDownload
90The predictive power of online chatter. Daniel Gruhl, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, Andrew Tomkins. KDD 2005, 78-87. Cited by 78Web SearchBibTeXDownload
89Variable latent semantic indexing. Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins. KDD 2005, 13-21. Cited by 10Web SearchBibTeXDownload
88Unweaving a web of documents. Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram. KDD 2005, 574-579. Cited by 8Web SearchBibTeXDownload
87Multi-structural databases. Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins. PODS 2005, 184-195. Cited by 19Web SearchBibTeXDownload
86The Complexity of Approximating the Entropy. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld. SIAM J. Comput. (35): 132-150 (2005). Web SearchBibTeXDownload
85Discovering Large Dense Subgraphs in Massive Graphs. David Gibson, Ravi Kumar, Andrew Tomkins. VLDB 2005, 721-732. Cited by 62Web SearchBibTeXDownload
84Efficient Implementation of Large-Scale Multi-Structural Databases. Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins. VLDB 2005, 958-969. Cited by 10Web SearchBibTeXDownload
83On the Bursty Evolution of Blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. World Wide Web (8): 159-178 (2005). Cited by 328Web SearchBibTeXDownload
2004
82The Sketching Complexity of Pattern Matching. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. APPROX-RANDOM 2004, 261-272. Web SearchBibTeXDownload
81Structure and evolution of blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. Commun. ACM (47): 35-39 (2004). Web SearchBibTeXDownload
80Approximating Edit Distance Efficiently. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. FOCS 2004, 550-559. Web SearchBibTeXDownload
79Fast approximate probabilistically checkable proofs. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. Inf. Comput. (189): 135-159 (2004). Web SearchBibTeXDownload
78Cell-probe lower bounds for the partial match problem. T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani. J. Comput. Syst. Sci. (69): 435-447 (2004). Cited by 27Web SearchBibTeXDownload
77An information statistics approach to data stream and communication complexity. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar. J. Comput. Syst. Sci. (68): 702-732 (2004). Cited by 139Web SearchBibTeXDownload
76A graph-theoretic approach to extract storylines from search results. Ravi Kumar, Uma Mahadevan, D. Sivakumar. KDD 2004, 216-225. Cited by 23Web SearchBibTeXDownload
75Comparing and Aggregating Rankings with Ties. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee. PODS 2004, 47-58. Cited by 73Web SearchBibTeXDownload
74Minimizing Wirelength in Zero and Bounded Skew Clock Trees. Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins. SIAM J. Discrete Math. (17): 582-595 (2004). Cited by 11Web SearchBibTeXDownload
73An improved data stream algorithm for frequency moments. Don Coppersmith, Ravi Kumar. SODA 2004, 151-156. Web SearchBibTeXDownload
72Sublinear algorithms for testing monotone and unimodal distributions. Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld. STOC 2004, 381-390. Web SearchBibTeXDownload
71Sic transit gloria telae: towards an understanding of the web's decay. Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins. WWW 2004, 328-337. Cited by 70Web SearchBibTeXDownload
70Propagation of trust and distrust. Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins. WWW 2004, 403-412. Cited by 423Web SearchBibTeXDownload
2003
69Link Evolution: Analysis and Algorithms. Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar. Internet Mathematics (1) (2003). Cited by 30Web SearchBibTeX
68On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. Ravi Kumar, D. Sivakumar. SIAM J. Discrete Math. (16): 422-425 (2003). Cited by 6Web SearchBibTeXDownload
67Comparing Top k Lists. Ronald Fagin, Ravi Kumar, D. Sivakumar. SIAM J. Discrete Math. (17): 134-160 (2003). Web SearchBibTeXDownload
66Algorithms column: sublinear time algorithms. Ravi Kumar, Ronitt Rubinfeld. SIGACT News (34): 57-67 (2003). Web SearchBibTeXDownload
65Efficient similarity search and classification via rank aggregation. Ronald Fagin, Ravi Kumar, D. Sivakumar. SIGMOD Conference 2003, 301-312. Cited by 138Web SearchBibTeXDownload
64Comparing top k lists. Ronald Fagin, Ravi Kumar, D. Sivakumar. SODA 2003, 28-36. Cited by 258Web SearchBibTeXDownload
63A note on the set systems used for broadcast encryption. Ravi Kumar, Alexander Russell. SODA 2003, 470-471. Web SearchBibTeXDownload
62Two applications of information complexity. T. S. Jayram, Ravi Kumar, D. Sivakumar. STOC 2003, 673-682. Cited by 33Web SearchBibTeXDownload
61Cell-probe lower bounds for the partial match problem. T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani. STOC 2003, 667-672. Cited by 27Web SearchBibTeXDownload
60On the bursty evolution of blogspace. Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins. WWW 2003, 568-576. Web SearchBibTeXDownload
59Searching the workplace web. Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson. WWW 2003, 366-375. Cited by 104Web SearchBibTeXDownload
2002
58Self-similarity in the web. Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins. ACM Trans. Internet Techn. (2): 205-223 (2002). Cited by 206Web SearchBibTeXDownload
57An Information Statistics Approach to Data Stream and Communication Complexity. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar. FOCS 2002, 209-218. Cited by 3Web SearchBibTeXDownload
56The Web and Social Networks. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. IEEE Computer (35): 32-36 (2002). Cited by 59Web SearchBibTeXDownload
55Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. Miklós Ajtai, Ravi Kumar, D. Sivakumar. IEEE Conference on Computational Complexity 2002, 53-57. Cited by 18Web SearchBibTeXDownload
54Information Theory Methods in Communication Complexity. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar. IEEE Conference on Computational Complexity 2002, 93-102. Cited by 37Web SearchBibTeXDownload
53The Complexity of Approximating the Entropy. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld. IEEE Conference on Computational Complexity 2002, 17. Web SearchBibTeXDownload
52Counting Distinct Elements in a Data Stream. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan. RANDOM 2002, 1-10. Cited by 140Web SearchBibTeXDownload
51Reductions in streaming algorithms, with an application to counting triangles in graphs. Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar. SODA 2002, 623-632. Cited by 96Web SearchBibTeXDownload
50Approximate counting of inversions in a data stream. Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar. STOC 2002, 370-379. Cited by 43Web SearchBibTeXDownload
49The complexity of approximating entropy. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld. STOC 2002, 678-687. Web SearchBibTeXDownload
2001
48An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. Miklós Ajtai, Ravi Kumar, D. Sivakumar. CaLC 2001, 1-3. Web SearchBibTeXDownload
47Testing Random Variables for Independence and Identity. Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White. FOCS 2001, 442-451. Web SearchBibTeXDownload
46Recommendation Systems: A Probabilistic Analysis. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. J. Comput. Syst. Sci. (63): 42-61 (2001). Cited by 81Web SearchBibTeXDownload
45Selective private function evaluation with applications to private statistics. Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright. PODC 2001, 293-304. Web SearchBibTeXDownload
44Checking Approximate Computations of Polynomials and Functional Equations. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. SIAM J. Comput. (31): 550-576 (2001). Web SearchBibTeXDownload
43On polynomial approximation to the shortest lattice vector length. Ravi Kumar, D. Sivakumar. SODA 2001, 126-127. Cited by 11Web SearchBibTeXDownload
42A sieve algorithm for the shortest lattice vector problem. Miklós Ajtai, Ravi Kumar, D. Sivakumar. STOC 2001, 601-610. Cited by 173Web SearchBibTeXDownload
41Sampling algorithms: lower bounds and applications. Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar. STOC 2001, 266-275. Cited by 53Web SearchBibTeXDownload
40On the unique shortest lattice vector problem. Ravi Kumar, D. Sivakumar. Theor. Comput. Sci. (255): 641-648 (2001). Cited by 5Web SearchBibTeXDownload
39Self-similarity in the Web. Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins. VLDB 2001, 69-78. Cited by 2Web SearchBibTeXDownload
38On Semi-Automated Web Taxonomy Construction. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. WebDB 2001, 91-96. Cited by 16Web SearchBibTeX
37Rank aggregation methods for the Web. Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar. WWW 2001, 613-622. Cited by 452Web SearchBibTeXDownload
2000
36Graph structure in the Web. Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, Janet L. Wiener. Computer Networks (33): 309-320 (2000). Cited by 1576Web SearchBibTeXDownload
35Combinatorial feature selection problems. Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai. FOCS 2000, 631-640. Web SearchBibTeXDownload
34Random graph models for the web graph. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal. FOCS 2000, 57-65. Cited by 383Web SearchBibTeXDownload
33The Web as a Graph. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal. PODS 2000, 1-10. Cited by 200Web SearchBibTeX
32Self-Testing without the Generator Bottleneck. Funda Ergün, Ravi Kumar, D. Sivakumar. SIAM J. Comput. (29): 1630-1651 (2000). Cited by 10Web SearchBibTeXDownload
1999
31Approximating Latin Square Extensions. Ravi Kumar, Alexander Russell, Ravi Sundaram. Algorithmica (24): 128-138 (1999). Web SearchBibTeXDownload
30Topic Distillation and Spectral Filtering. Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. Artif. Intell. Rev. (13): 409-435 (1999). Cited by 14Web SearchBibTeXDownload
29The Web as a Graph: Measurements, Models, and Methods. Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. COCOON 1999, 1-17. Cited by 539Web SearchBibTeXDownload
28Trawling the Web for Emerging Cyber-Communities. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. Computer Networks (31): 1481-1493 (1999). Cited by 776Web SearchBibTeXDownload
27Coding Constructions for Blacklisting Problems without Computational Assumptions. Ravi Kumar, Sridhar Rajagopalan, Amit Sahai. CRYPTO 1999, 609-623. Web SearchBibTeXDownload
26A Note on the Limits of Collusion-Resistant Watermarks. Funda Ergün, Joe Kilian, Ravi Kumar. EUROCRYPT 1999, 140-149. Web SearchBibTeXDownload
25Mining the Web's Link Structure. Soumen Chakrabarti, Byron Dom, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon M. Kleinberg. IEEE Computer (32): 60-67 (1999). Cited by 390Web SearchBibTeXDownload
24Proofs, Codes, and Polynomial-Time Reducibilities. Ravi Kumar, D. Sivakumar. IEEE Conference on Computational Complexity 1999, 46-53. Cited by 14Web SearchBibTeXDownload
23A Note on the Shortest Lattice Vector Problem. Ravi Kumar, D. Sivakumar. IEEE Conference on Computational Complexity 1999, 200-204. Cited by 9Web SearchBibTeXDownload
22Spatial Color Indexing and Applications. Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih. International Journal of Computer Vision (35): 245-268 (1999). Web SearchBibTeXDownload
21Roundness Estimation via Random Sampling. Ravi Kumar, D. Sivakumar. SODA 1999, 603-612. Cited by 4Web SearchBibTeXDownload
20Minimizing Wirelength in Zero and Bounded Skew Clock Trees. Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins. SODA 1999, 177-184. Cited by 11Web SearchBibTeXDownload
19Fast Approximate PCPs. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. STOC 1999, 41-50. Web SearchBibTeXDownload
18On targeting Markov segments. Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. STOC 1999, 99-108. Cited by 14Web SearchBibTeXDownload
17Extracting Large-Scale Knowledge Bases from the Web. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. VLDB 1999, 639-650. Cited by 241Web SearchBibTeX
1998
16An Automatic Hierarchical Image Classification Scheme. Jing Huang, Ravi Kumar, Ramin Zabih. ACM Multimedia 1998, 219-228. Web SearchBibTeXDownload
15Recommendation Systems: A Probabilistic Analysis. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. FOCS 1998, 664-673. Cited by 81Web SearchBibTeXDownload
14Spatial Color Indexing and Applications. Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih. ICCV 1998, 602-607. Web SearchBibTeX
1997
13Combining Supervised Learning with Color Correlograms for Content-Based Image Retrieval. Jing Huang, Ravi Kumar, Mandar Mitra. ACM Multimedia 1997, 325-334. Web SearchBibTeXDownload
12Learning Distributions from Random Walks. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. COLT 1997, 243-249. Web SearchBibTeXDownload
11Image Indexing Using Color Correlograms. Jing Huang, Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih. CVPR 1997, 762-768. Web SearchBibTeXDownload
10Checking Properties of Polynomials (Extended Abstract). Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar. ICALP 1997, 203-213. Web SearchBibTeXDownload
9Faster Algorithms for Optical Switch Configuration. Ravi Kumar, Alexander Russell, Ravi Sundaram. ICC (3) 1997, 1320-1324. Web SearchBibTeX
8A Note on Optical Routing on Trees. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram. Inf. Process. Lett. (62): 295-300 (1997). Web SearchBibTeXDownload
1996
7Approximating Latin Square Extensions. Ravi Kumar, Alexander Russell, Ravi Sundaram. COCOON 1996, 280-289. Web SearchBibTeXDownload
6Approximate Checking of Polynomials and Functional Equations (extended abstract). Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. FOCS 1996, 592-601. Web SearchBibTeXDownload
5Efficient Self-Testing/Self-Correction of Linear Recurrences. Ravi Kumar, D. Sivakumar. FOCS 1996, 602-611. Cited by 6Web SearchBibTeXDownload
4Scalability Study of the KSR-1. Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy. Parallel Computing (22): 739-759 (1996). Web SearchBibTeXDownload
1995
3On Learning Bounded-Width Branching Programs. Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. COLT 1995, 361-368. Web SearchBibTeXDownload
2On Self-Testing without the Generator Bottleneck. Ravi Kumar, D. Sivakumar. FSTTCS 1995, 248-262. Cited by 7Web SearchBibTeXDownload
1993
1Scalability Study of the KSR-1. Umakishore Ramachandran, Gautam Shah, Ravi Kumar, Jeyakumar Muthukumarasamy. ICPP 1993, 237-240. Web SearchBibTeX
from DBLP and Google Scholar
References
1. ^ WWW2010 – Raleigh: Committee - Retrieved 2011-03-19 - details
2. ^ KDD 2009: Research Track Program Committee - Retrieved 2009-11-21 - details
3. ^ www 2009 Madrid - Retrieved 2011-06-28 - details
4. ^ CIKM 2008 | Program Committee - Retrieved 2010-11-25 - details
5. ^ Computer Science Colloquium - Retrieved 2011-04-23 - details
6. ^ UT-Austin Data Mining Seminar Schedule Abstracts - Retrieved 2010-09-28 - details
7. ^ WWW2008 Tutorials CFP - WWW 2008 Tutorials: Call For Papers - Retrieved 2011-06-28 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research