On Self-Testing without the Generator Bottleneck. - Ravi Kumar 001; D. Sivakumar 001 (FSTTCS, 1995)

Efficient Self-Testing/Self-Correction of Linear Recurrences. - Ravi Kumar 001; D. Sivakumar 001 (FOCS, 1996)

Proofs, Codes, and Polynomial-Time Reducibilities. - Ravi Kumar 001; D. Sivakumar 001 (CCC, 1999)

A Note on the Shortest Lattice Vector Problem. - Ravi Kumar 001; D. Sivakumar 001 (CCC, 1999)

Roundness Estimation via Random Sampling. - Ravi Kumar 001; D. Sivakumar 001 (SODA, 1999)

Random graph models for the web graph. - Ravi Kumar 001; Prabhakar Raghavan; Sridhar Rajagopalan; D. Sivakumar 001; Andrew Tomkins; Eli Upfal (FOCS, 2000)

The Web as a Graph. - Ravi Kumar 001; Prabhakar Raghavan; Sridhar Rajagopalan; D. Sivakumar 001; Andrew Tomkins; Eli Upfal (PODS, 2000)

Self-Testing without the Generator Bottleneck. - Funda Ergün; Ravi Kumar 001; D. Sivakumar 001 (SIAM J. Comput., 2000)

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. - Miklós Ajtai; Ravi Kumar 001; D. Sivakumar 001 (CaLC, 2001)

On polynomial approximation to the shortest lattice vector length. - Ravi Kumar 001; D. Sivakumar 001 (SODA, 2001)

A sieve algorithm for the shortest lattice vector problem. - Miklós Ajtai; Ravi Kumar 001; D. Sivakumar 001 (STOC, 2001)

Sampling algorithms: lower bounds and applications. - Ziv Bar-Yossef; Ravi Kumar 001; D. Sivakumar 001 (STOC, 2001)

Rank aggregation methods for the Web. - Cynthia Dwork; Ravi Kumar 001; Moni Naor; D. Sivakumar 001 (WWW, 2001)

On the unique shortest lattice vector problem. - Ravi Kumar 001; D. Sivakumar 001 (Theor. Comput. Sci., 2001)

Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. - Miklós Ajtai; Ravi Kumar 001; D. Sivakumar 001 (CCC, 2002)

Information Theory Methods in Communication Complexity. - Ziv Bar-Yossef; T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001 (CCC, 2002)

Counting Distinct Elements in a Data Stream. - Ziv Bar-Yossef; T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001; Luca Trevisan 001 (RANDOM, 2002)

Reductions in streaming algorithms, with an application to counting triangles in graphs. - Ziv Bar-Yossef; Ravi Kumar 001; D. Sivakumar 001 (SODA, 2002)

Approximate counting of inversions in a data stream. - Miklós Ajtai; T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001 (STOC, 2002)

Self-similarity in the web. - Stephen Dill; Ravi Kumar 001; Kevin S. McCurley; Sridhar Rajagopalan; D. Sivakumar 001; Andrew Tomkins (ACM Trans. Internet Techn., 2002)

Efficient similarity search and classification via rank aggregation. - Ronald Fagin; Ravi Kumar 001; D. Sivakumar 001 (SIGMOD Conference, 2003)

Two applications of information complexity. - T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001 (STOC, 2003)

Searching the workplace web. - Ronald Fagin; Ravi Kumar 001; Kevin S. McCurley; Jasmine Novak; D. Sivakumar 001; John A. Tomlin; David P. Williamson (WWW, 2003)

Link Evolution: Analysis and Algorithms. - Steve Chien; Cynthia Dwork; Ravi Kumar 001; Daniel R. Simon; D. Sivakumar 001 (Internet Math., 2003)

Comparing Top k Lists. - Ronald Fagin; Ravi Kumar 001; D. Sivakumar 001 (SIAM J. Discret. Math., 2003)

On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. - Ravi Kumar 001; D. Sivakumar 001 (SIAM J. Discret. Math., 2003)

Framework and algorithms for trend analysis in massive temporal data sets. - Sreenivas Gollapudi; D. Sivakumar 001 (CIKM, 2004)

Data stream algorithms for scalable bandwidth management. - Sreenivas Gollapudi; D. Sivakumar 001 (ICC, 2004)

A mechanism for equitable bandwidth allocation under QoS and budget constraints. - Sreenivas Gollapudi; D. Sivakumar 001 (IWQoS, 2004)

A graph-theoretic approach to extract storylines from search results. - Ravi Kumar 001; Uma Mahadevan; D. Sivakumar 001 (KDD, 2004)

Comparing and Aggregating Rankings with Ties. - Ronald Fagin; Ravi Kumar 001; Mohammad Mahdian; D. Sivakumar 001; Erik Vee (PODS, 2004)

An information statistics approach to data stream and communication complexity. - Ziv Bar-Yossef; T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001 (J. Comput. Syst. Sci., 2004)

Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. - Sreenivas Gollapudi; D. Sivakumar 001; Aidong Zhang (INFOCOM, 2005)

Unweaving a web of documents. - Ramanathan V. Guha; Ravi Kumar 001; D. Sivakumar 001; Ravi Sundaram (KDD, 2005)

Multi-structural databases. - Ronald Fagin; Ramanathan V. Guha; Ravi Kumar 001; Jasmine Novak; D. Sivakumar 001; Andrew Tomkins (PODS, 2005)

Efficient Implementation of Large-Scale Multi-Structural Databases. - Ronald Fagin; Phokion G. Kolaitis; Ravi Kumar 001; Jasmine Novak; D. Sivakumar 001; Andrew Tomkins (VLDB, 2005)

Programmable clustering. - Sreenivas Gollapudi; Ravi Kumar 001; D. Sivakumar 001 (PODS, 2006)

On the Hardness of Approximating Multicut and Sparsest-Cut. - Shuchi Chawla 001; Robert Krauthgamer; Ravi Kumar 001; Yuval Rabani; D. Sivakumar 001 (Comput. Complex., 2006)

Comparing Partial Rankings. - Ronald Fagin; Ravi Kumar 001; Mohammad Mahdian; D. Sivakumar 001; Erik Vee (SIAM J. Discret. Math., 2006)

Communication Lower Bounds Via the Chromatic Number. - Ravi Kumar 001; D. Sivakumar 001 (FSTTCS, 2007)

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 001; Mihai Patrascu; D. Sivakumar 001 (SIGMOD Conference, 2008)

The One-Way Communication Complexity of Hamming Distance. - T. S. Jayram; Ravi Kumar 001; D. Sivakumar 001 (Theory Comput., 2008)

Affiliation networks. - Silvio Lattanzi; D. Sivakumar 001 (STOC, 2009)

Milgram-routing in social networks. - Silvio Lattanzi; Alessandro Panconesi; D. Sivakumar 001 (WWW, 2011)

Sparse and Lopsided Set Disjointness via Information Theory. - Anirban Dasgupta 001; Ravi Kumar 001; D. Sivakumar 001 (APPROX-RANDOM, 2012)

Social sampling. - Anirban Dasgupta 001; Ravi Kumar 001; D. Sivakumar 001 (KDD, 2012)

Attention and Selection in Online Choice Tasks. - Vidhya Navalpakkam; Ravi Kumar 001; Lihong Li 001; D. Sivakumar 001 (UMAP, 2012)

Introduction to the Special Issue on Algorithms and Models for the Web Graph. - Anthony Bonato; Ravi Kumar 001; D. Sivakumar 001 (Internet Math., 2012)

An Algorithmic View of Voting. - Ronald Fagin; Ravi Kumar 001; Mohammad Mahdian; D. Sivakumar 001; Erik Vee (SIAM J. Discret. Math., 2016)

Constructing a Comprehensive Events Database from the Web. - Qifan Wang 001; Bhargav Kanagal; Vijay Garg; D. Sivakumar 001 (CIKM, 2019)

A new dog learns old tricks: RL finds classic optimization algorithms. - Weiwei Kong; Christopher Liaw; Aranyak Mehta; D. Sivakumar 001 (ICLR (Poster), 2019)

Learning to Extract Attribute Value from Product via Question Answering: A Multi-task Approach. - Qifan Wang 001; Li Yang; Bhargav Kanagal; Sumit Sanghai; D. Sivakumar 001; Bin Shu; Zac Yu; Jon Elsas (KDD, 2020)

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. - Goran Zuzic; Di Wang 005; Aranyak Mehta; D. Sivakumar 001 (CoRR, 2020)

ShopTalk: A System for Conversational Faceted Search. - Gurmeet Manku; James Lee-Thorp; Bhargav Kanagal; Joshua Ainslie; Jingchen Feng; Zach Pearson; Ebenezer Anjorin; Sudeep Gandhe; Ilya Eckstein; Jim Rosswog; Sumit Sanghai; Michael Pohl; et al. (CoRR, 2021)