Affiliation Networks, Silvio Lattanzi, D. Sivakumar, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 427-434.
Text Classification Through Time: Efficient Label Propagation in Time-Based Graphs, Shumeet Baluja, Deepak Ravichandran, D. Sivakumar, International Conference on Knowledge Discovery and Information Retrieval, 2009.
Corrigendum to Efficient Similarity Search and Classification via Rank Aggregation, Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar, Proc. ACM SIGMOD International Conference on Management of Data, 2008, pp. 1375-1376.
The One-Way Communication Complexity of Hamming Distance, T. S. Jayram, Ravi Kumar, D. Sivakumar, Theory of Computing, vol. 4 (2008), pp. 129-135.
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, WWW-2008.
Programmable clustering, Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar, PODS, 2006, pp. 348-354.
Communication Lower Bounds Via the Chromatic Number, Ravi Kumar, D. Sivakumar, Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, 2007, pp. 228-240.
Efficient Implementation of Large-Scale Multi-Structural Databases, Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins, VLDB, 2005, pp. 958-969.
Multi-structural databases, Ronald Fagin, R. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins, PODS, 2005, pp. 184-195.
On the Hardness of Approximating Multicut and Sparsest-Cut, Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar, IEEE Conference on Computational Complexity, 2005, pp. 144-153.
Unweaving a web of documents, R. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram, KDD, 2005, pp. 574-579.
A graph-theoretic approach to extract storylines from search results, Ravi Kumar, Uma Mahadevan, D. Sivakumar, KDD, 2004, pp. 216-225.
A mechanism for equitable bandwidth allocation under QoS and budget constraints, Sreenivas Gollapudi, D. Sivakumar, IWQoS, 2004, pp. 138-147.
An information statistics approach to data stream and communication complexity, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, J. Comput. Syst. Sci., vol. 68 (2004), pp. 702-732.
Comparing and Aggregating Rankings with Ties, Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee, PODS, 2004, pp. 47-58.
Framework and algorithms for trend analysis in massive temporal data sets, Sreenivas Gollapudi, D. Sivakumar, CIKM, 2004, pp. 168-177.
Comparing Top k Lists, Ronald Fagin, Ravi Kumar, D. Sivakumar, SIAM J. Discrete Math., vol. 17 (2003), pp. 134-160.
Comparing top k lists, Ronald Fagin, Ravi Kumar, D. Sivakumar, SODA, 2003, pp. 28-36.
Efficient similarity search and classification via rank aggregation, Ronald Fagin, Ravi Kumar, D. Sivakumar, SIGMOD Conference, 2003, pp. 301-312.
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length, Ravi Kumar, D. Sivakumar, SIAM J. Discrete Math., vol. 16 (2003), pp. 422-425.
Searching the workplace web, Ronald Fagin, Ravi Kumar, Kevin S. McCurley, D. Sivakumar, John A. Tomlin, David P. Williamson, WWW, 2003, pp. 366-375.
Two applications of information complexity, T. S. Jayram, Ravi Kumar, D. Sivakumar, STOC, 2003, pp. 673-682.
Algorithmic Derandomization via Complexity Theory, D. Sivakumar, IEEE Conference on Computational Complexity, 2002, pp. 10.
Algorithmic derandomization via complexity theory, D. Sivakumar, STOC, 2002, pp. 619-626.
An Information Statistics Approach to Data Stream and Communication Complexity, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, FOCS, 2002, pp. 209-218.
Approximate counting of inversions in a data stream, Miklös Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar, STOC, 2002, pp. 370-379.
Counting Distinct Elements in a Data Stream, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan, RANDOM, 2002, pp. 1-10.
Information Theory Methods in Communication Complexity, Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, IEEE Conference on Computational Complexity, 2002, pp. 93-102.
Reductions in streaming algorithms, with an application to counting triangles in graphs, Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, SODA, 2002, pp. 623-632.
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem, Miklös Ajtai, Ravi Kumar, D. Sivakumar, IEEE Conference on Computational Complexity, 2002, pp. 53-57.
Self-similarity in the web, Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, ACM Trans. Internet Techn., vol. 2 (2002), pp. 205-223.
A sieve algorithm for the shortest lattice vector problem, Miklös Ajtai, Ravi Kumar, D. Sivakumar, STOC, 2001, pp. 601-610.
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem, Mikl�s Ajtai, Ravi Kumar, D. Sivakumar, CaLC, 2001, pp. 1-3.
On polynomial approximation to the shortest lattice vector length, Ravi Kumar, D. Sivakumar, SODA, 2001, pp. 126-127.
On the unique shortest lattice vector problem, Ravi Kumar, D. Sivakumar, Theor. Comput. Sci., vol. 255 (2001), pp. 641-648.
Rank aggregation methods for the Web, Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar, WWW, 2001, pp. 613-622.
Sampling algorithms: lower bounds and applications, Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, STOC, 2001, pp. 266-275.
Self-similarity in the Web, Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, VLDB, 2001, pp. 69-78.
Quasilinear Time Complexity Theory, Ashish V. Naik, Kenneth W. Regan, D. Sivakumar, STACS, 1994, pp. 97-108.