D. Sivakumar - RankMe

60 papers A* 26A 8B 1C 1Journal 14Unranked 9

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	ShopTalk: A System for Conversational Faceted Search. CoRR 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
2020	J	`jnl`	Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. CoRR Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar
2020	A*	`conf`	Learning to Extract Attribute Value from Product via Question Answering: A Multi-task Approach. KDD Qifan Wang, Li Yang, Bhargav Kanagal, Sumit Sanghai, D. Sivakumar, Bin Shu, Zac Yu, Jon Elsas
2019	—	`conf`	A new dog learns old tricks: RL finds classic optimization algorithms. ICLR (Poster) Weiwei Kong, Christopher Liaw, Aranyak Mehta, D. Sivakumar
2019	A	`conf`	Constructing a Comprehensive Events Database from the Web. CIKM Qifan Wang, Bhargav Kanagal, Vijay Garg, D. Sivakumar
2017	—	`ed.`	Joint Proceedings of the International Workshops on Hybrid Statistical Semantic Understanding and Emerging Semantics, and Semantic Statistics co-located with 16th International Semantic Web Conference, HybridSemStats@ISWC 2017, Vienna, Austria October 22nd, 2017 HybridSemStats@ISWC Sarven Capadisli, Franck Cotton, Xin Luna Dong, Ramanathan V. Guha, Armin Haller, Pascal Hitzler, Evangelos Kalampokis, Mayank Kejriwal, Freddy Lécué, D. Sivakumar, Pedro A. Szekely, Raphaël Troncy, Michael Witbrock
2016	J	`jnl`	An Algorithmic View of Voting. SIAM J. Discret. Math. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
2012	A	`conf`	Attention and Selection in Online Choice Tasks. UMAP Vidhya Navalpakkam, Ravi Kumar, Lihong Li, D. Sivakumar
2012	J	`jnl`	Introduction to the Special Issue on Algorithms and Models for the Web Graph. Internet Math. Anthony Bonato, Ravi Kumar, D. Sivakumar
2012	A*	`conf`	Social sampling. KDD Anirban Dasgupta, Ravi Kumar, D. Sivakumar
2012	—	`conf`	Sparse and Lopsided Set Disjointness via Information Theory. APPROX-RANDOM Anirban Dasgupta, Ravi Kumar, D. Sivakumar
2011	A*	`conf`	Milgram-routing in social networks. WWW Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar
2010	C	`ed.`	Algorithms and Models for the Web-Graph - 7th International Workshop, WAW 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings WAW Ravi Kumar, D. Sivakumar
2009	A*	`conf`	Affiliation networks. STOC Silvio Lattanzi, D. Sivakumar
2008	—	`conf`	Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar
2008	J	`jnl`	The One-Way Communication Complexity of Hamming Distance. Theory Comput. T. S. Jayram, Ravi Kumar, D. Sivakumar
2007	—	`conf`	Communication Lower Bounds Via the Chromatic Number. FSTTCS Ravi Kumar, D. Sivakumar
2006	J	`jnl`	Comparing Partial Rankings. SIAM J. Discret. Math. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
2006	J	`jnl`	On the Hardness of Approximating Multicut and Sparsest-Cut. Comput. Complex. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
2006	A*	`conf`	Programmable clustering. PODS Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
2005	A*	`conf`	Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
2005	A*	`conf`	Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
2005	A*	`conf`	Multi-structural databases. PODS Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
2005	A	`conf`	On the Hardness of Approximating Multicut and Sparsest-Cut. CCC Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
2005	A*	`conf`	Unweaving a web of documents. KDD Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram
2004	A*	`conf`	A graph-theoretic approach to extract storylines from search results. KDD Ravi Kumar, Uma Mahadevan, D. Sivakumar
2004	B	`conf`	A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS Sreenivas Gollapudi, D. Sivakumar
2004	J	`jnl`	An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2004	A*	`conf`	Comparing and Aggregating Rankings with Ties. PODS Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
2004	—	`conf`	Data stream algorithms for scalable bandwidth management. ICC Sreenivas Gollapudi, D. Sivakumar
2004	A	`conf`	Framework and algorithms for trend analysis in massive temporal data sets. CIKM Sreenivas Gollapudi, D. Sivakumar
2003	J	`jnl`	Comparing Top k Lists. SIAM J. Discret. Math. Ronald Fagin, Ravi Kumar, D. Sivakumar
2003	A*	`conf`	Comparing top k lists. SODA Ronald Fagin, Ravi Kumar, D. Sivakumar
2003	—	`conf`	Efficient similarity search and classification via rank aggregation. SIGMOD Conference Ronald Fagin, Ravi Kumar, D. Sivakumar
2003	J	`jnl`	Link Evolution: Analysis and Algorithms. Internet Math. Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar
2003	J	`jnl`	On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discret. Math. Ravi Kumar, D. Sivakumar
2003	A*	`conf`	Searching the workplace web. WWW Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson
2003	A*	`conf`	Two applications of information complexity. STOC T. S. Jayram, Ravi Kumar, D. Sivakumar
2002	A*	`conf`	An Information Statistics Approach to Data Stream and Communication Complexity. FOCS Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002	A*	`conf`	Approximate counting of inversions in a data stream. STOC Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002	—	`conf`	Counting Distinct Elements in a Data Stream. RANDOM Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
2002	A	`conf`	Information Theory Methods in Communication Complexity. CCC Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
2002	A*	`conf`	Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
2002	A	`conf`	Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. CCC Miklós Ajtai, Ravi Kumar, D. Sivakumar
2002	J	`jnl`	Self-similarity in the web. ACM Trans. Internet Techn. Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
2001	A*	`conf`	A sieve algorithm for the shortest lattice vector problem. STOC Miklós Ajtai, Ravi Kumar, D. Sivakumar
2001	—	`conf`	An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC Miklós Ajtai, Ravi Kumar, D. Sivakumar
2001	A*	`conf`	On polynomial approximation to the shortest lattice vector length. SODA Ravi Kumar, D. Sivakumar
2001	J	`jnl`	On the unique shortest lattice vector problem. Theor. Comput. Sci. Ravi Kumar, D. Sivakumar
2001	A*	`conf`	Rank aggregation methods for the Web. WWW Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
2001	A*	`conf`	Sampling algorithms: lower bounds and applications. STOC Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
2001	A*	`conf`	Self-similarity in the Web. VLDB Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
2000	A*	`conf`	Random graph models for the web graph. FOCS Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
2000	J	`jnl`	Self-Testing without the Generator Bottleneck. SIAM J. Comput. Funda Ergün, Ravi Kumar, D. Sivakumar
2000	A*	`conf`	The Web as a Graph. PODS Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
1999	A	`conf`	A Note on the Shortest Lattice Vector Problem. CCC Ravi Kumar, D. Sivakumar
1999	A	`conf`	Proofs, Codes, and Polynomial-Time Reducibilities. CCC Ravi Kumar, D. Sivakumar
1999	A*	`conf`	Roundness Estimation via Random Sampling. SODA Ravi Kumar, D. Sivakumar
1996	A*	`conf`	Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS Ravi Kumar, D. Sivakumar
1995	—	`conf`	On Self-Testing without the Generator Bottleneck. FSTTCS Ravi Kumar, D. Sivakumar