| 2020 | KDD | Learning to Extract Attribute Value from Product via Question Answering: A Multi-task Approach. | Qifan Wang, Li Yang, Bhargav Kanagal, Sumit Sanghai, D. Sivakumar, Bin Shu, Zac Yu, Jon Elsas |
| 2019 | CIKM | Constructing a Comprehensive Events Database from the Web. | Qifan Wang, Bhargav Kanagal, Vijay Garg, D. Sivakumar |
| 2019 | ICLR | A new dog learns old tricks: RL finds classic optimization algorithms. | Weiwei Kong, Christopher Liaw, Aranyak Mehta, D. Sivakumar |
| 2012 | KDD | Social sampling. | Anirban Dasgupta, Ravi Kumar, D. Sivakumar |
| 2011 | IC3K | A Tale of Two (Similar) Cities - Inferring City Similarity through Geo-spatial Query Log Analysis. | Rohan Seth, Michele Covell, Deepak Ravichandran, D. Sivakumar, Shumeet Baluja |
| 2011 | WWW | Milgram-routing in social networks. | Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar |
| 2009 | IC3K | Text Classification through Time - Efficient Label Propagation in Time-Based Graphs. | Shumeet Baluja, Deepak Ravichandran, D. Sivakumar |
| 2009 | STOC | Affiliation networks. | Silvio Lattanzi, D. Sivakumar |
| 2008 | WWW | Video suggestion and discovery for youtube: taking random walks through the view graph. | Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar, Deepak Ravichandran, Mohamed Aly |
| 2008 | SIGMOD | Corrigendum 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 |
| 2006 | PODS | Programmable clustering. | Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar |
| 2005 | INFOCOM | Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. | Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang |
| 2005 | KDD | Unweaving a web of documents. | Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram |
| 2005 | PODS | Multi-structural databases. | Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins |
| 2005 | VLDB | Efficient Implementation of Large-Scale Multi-Structural Databases. | Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins |
| 2004 | CIKM | Framework and algorithms for trend analysis in massive temporal data sets. | Sreenivas Gollapudi, D. Sivakumar |
| 2004 | IWQoS | A mechanism for equitable bandwidth allocation under QoS and budget constraints. | Sreenivas Gollapudi, D. Sivakumar |
| 2004 | KDD | A graph-theoretic approach to extract storylines from search results. | Ravi Kumar, Uma Mahadevan, D. Sivakumar |
| 2004 | PODS | Comparing and Aggregating Rankings with Ties. | Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee |
| 2003 | WWW | Searching the workplace web. | Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson |
| 2003 | SIGMOD | Efficient similarity search and classification via rank aggregation. | Ronald Fagin, Ravi Kumar, D. Sivakumar |
| 2003 | SODA | Comparing top k lists. | Ronald Fagin, Ravi Kumar, D. Sivakumar |
| 2003 | STOC | Two applications of information complexity. | T. S. Jayram, Ravi Kumar, D. Sivakumar |
| 2002 | FOCS | An Information Statistics Approach to Data Stream and Communication Complexity. | Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar |
| 2002 | SODA | Reductions in streaming algorithms, with an application to counting triangles in graphs. | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar |
| 2002 | STOC | Approximate counting of inversions in a data stream. | Mikls Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar |
| 2002 | STOC | Algorithmic derandomization via complexity theory. | D. Sivakumar |
| 2001 | WWW | Rank aggregation methods for the Web. | Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar |
| 2001 | SODA | On polynomial approximation to the shortest lattice vector length. | Ravi Kumar, D. Sivakumar |
| 2001 | STOC | A sieve algorithm for the shortest lattice vector problem. | Mikls Ajtai, Ravi Kumar, D. Sivakumar |
| 2001 | STOC | Sampling algorithms: lower bounds and applications. | Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar |
| 2001 | VLDB | Self-similarity in the Web. | Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins |
| 2000 | FOCS | Random graph models for the web graph. | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal |
| 2000 | PODS | The Web as a Graph. | Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal |
| 1999 | SODA | Roundness Estimation via Random Sampling. | Ravi Kumar, D. Sivakumar |
| 1999 | STOC | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. | Jin-yi Cai, Ajay Nerurkar, D. Sivakumar |
| 1999 | STACS | On the Hardness of Permanent. | Jin-yi Cai, Aduri Pavan, D. Sivakumar |
| 1998 | STACS | A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss |
| 1997 | COCOON | Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. | Jin-yi Cai, D. Sivakumar |
| 1997 | FOCS | Constant Depth Circuits and the Lutz Hypothesis. | Jin-yi Cai, D. Sivakumar, Martin Strauss |
| 1996 | FOCS | Efficient Self-Testing/Self-Correction of Linear Recurrences. | Ravi Kumar, D. Sivakumar |
| 1996 | STACS | On the Existence of Hard Sparse Sets under Weak Reductions. | Jin-yi Cai, Ashish V. Naik, D. Sivakumar |
| 1995 | FOCS | The Resolution of a Hartmanis Conjecture. | Jin-yi Cai, D. Sivakumar |
| 1995 | FOCS | Pseudorandom Generators, Measure Theory, and Natural Proofs. | Kenneth W. Regan, D. Sivakumar, Jin-yi Cai |
| 1995 | STACS | Communication Complexity of Key Agreement on Small Ranges. | Jin-yi Cai, Richard J. Lipton, Luc Longpr, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar |
| 1994 | STACS | Quasilinear Time Complexity Theory. | Ashish V. Naik, Kenneth W. Regan, D. Sivakumar |