D. Sivakumar

Publication Activity (10 Years)

Years Active: 1995-2021
Publications (10 Years): 6

Top Topics

Conditional Entropy

Top Venues

Publications

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, Larry Adams, D. Sivakumar
ShopTalk: A System for Conversational Faceted Search. CoRR (2021)
Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. CoRR (2020)
Qifan Wang, Li Yang, Bhargav Kanagal, Sumit Sanghai, D. Sivakumar, Bin Shu, Zac Yu, Jon Elsas
Learning to Extract Attribute Value from Product via Question Answering: A Multi-task Approach. KDD (2020)
Qifan Wang, Bhargav Kanagal, Vijay Garg, D. Sivakumar
Constructing a Comprehensive Events Database from the Web. CIKM (2019)
Weiwei Kong, Christopher Liaw, Aranyak Mehta, D. Sivakumar
A new dog learns old tricks: RL finds classic optimization algorithms. ICLR (Poster) (2019)
Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
An Algorithmic View of Voting. SIAM J. Discret. Math. 30 (4) (2016)
Anthony Bonato, Ravi Kumar, D. Sivakumar
Introduction to the Special Issue on Algorithms and Models for the Web Graph. Internet Math. 8 (1-2) (2012)
Vidhya Navalpakkam, Ravi Kumar, Lihong Li, D. Sivakumar
Attention and Selection in Online Choice Tasks. UMAP (2012)
Anirban Dasgupta, Ravi Kumar, D. Sivakumar
Sparse and Lopsided Set Disjointness via Information Theory. APPROX-RANDOM (2012)
Anirban Dasgupta, Ravi Kumar, D. Sivakumar
Social sampling. KDD (2012)
Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar
Milgram-routing in social networks. WWW (2011)
Silvio Lattanzi, D. Sivakumar
Affiliation networks. STOC (2009)
T. S. Jayram, Ravi Kumar, D. Sivakumar
The One-Way Communication Complexity of Hamming Distance. Theory Comput. 4 (1) (2008)
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)
Ravi Kumar, D. Sivakumar
Communication Lower Bounds Via the Chromatic Number. FSTTCS (2007)
Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
Comparing Partial Rankings. SIAM J. Discret. Math. 20 (3) (2006)
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
Programmable clustering. PODS (2006)
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
On the Hardness of Approximating Multicut and Sparsest-Cut. Comput. Complex. 15 (2) (2006)
Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB (2005)
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
On the Hardness of Approximating Multicut and Sparsest-Cut. Computational Complexity Conference (2005)
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
Multi-structural databases. PODS (2005)
Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram
Unweaving a web of documents. KDD (2005)
Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM (2005)
Ravi Kumar, Uma Mahadevan, D. Sivakumar
A graph-theoretic approach to extract storylines from search results. KDD (2004)
Sreenivas Gollapudi, D. Sivakumar
Data stream algorithms for scalable bandwidth management. ICC (2004)
Sreenivas Gollapudi, D. Sivakumar
Framework and algorithms for trend analysis in massive temporal data sets. CIKM (2004)
Sreenivas Gollapudi, D. Sivakumar
A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS (2004)
Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
Comparing and Aggregating Rankings with Ties. PODS (2004)
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) (2004)
Ronald Fagin, Ravi Kumar, D. Sivakumar
Comparing top k lists. SODA (2003)
Ronald Fagin, Ravi Kumar, D. Sivakumar
Efficient similarity search and classification via rank aggregation. SIGMOD Conference (2003)
Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson
Searching the workplace web. WWW (2003)
Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar
Link Evolution: Analysis and Algorithms. Internet Math. 1 (3) (2003)
Ronald Fagin, Ravi Kumar, D. Sivakumar
Comparing Top k Lists. SIAM J. Discret. Math. 17 (1) (2003)
T. S. Jayram, Ravi Kumar, D. Sivakumar
Two applications of information complexity. STOC (2003)
Ravi Kumar, D. Sivakumar
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discret. Math. 16 (3) (2003)
Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
Approximate counting of inversions in a data stream. STOC (2002)
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
An Information Statistics Approach to Data Stream and Communication Complexity. FOCS (2002)
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
Information Theory Methods in Communication Complexity. Computational Complexity Conference (2002)
Miklós Ajtai, Ravi Kumar, D. Sivakumar
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. Computational Complexity Conference (2002)
Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
Self-similarity in the web. ACM Trans. Internet Techn. 2 (3) (2002)
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
Counting Distinct Elements in a Data Stream. RANDOM (2002)
Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA (2002)
Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
Sampling algorithms: lower bounds and applications. STOC (2001)
Miklós Ajtai, Ravi Kumar, D. Sivakumar
A sieve algorithm for the shortest lattice vector problem. STOC (2001)
Ravi Kumar, D. Sivakumar
On polynomial approximation to the shortest lattice vector length. SODA (2001)
Miklós Ajtai, Ravi Kumar, D. Sivakumar
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC (2001)
Ravi Kumar, D. Sivakumar
On the unique shortest lattice vector problem. Theor. Comput. Sci. 255 (1-2) (2001)
Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
Rank aggregation methods for the Web. WWW (2001)
Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
Self-similarity in the Web. VLDB (2001)
Funda Ergün, Ravi Kumar, D. Sivakumar
Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29 (5) (2000)
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
Random graph models for the web graph. FOCS (2000)
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
The Web as a Graph. PODS (2000)
Ravi Kumar, D. Sivakumar
A Note on the Shortest Lattice Vector Problem. Computational Complexity Conference (1999)
Ravi Kumar, D. Sivakumar
Proofs, Codes, and Polynomial-Time Reducibilities. Computational Complexity Conference (1999)
Ravi Kumar, D. Sivakumar
Roundness Estimation via Random Sampling. SODA (1999)
Ravi Kumar, D. Sivakumar
Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS (1996)
Ravi Kumar, D. Sivakumar
On Self-Testing without the Generator Bottleneck. FSTTCS (1995)