default search action
D. Sivakumar 0001
Person information
- affiliation: Google Inc., Mountain View, CA, USA
- affiliation (former): Yahoo! Research, Sunnyvale, CA, USA
- affiliation (former): IBM Almaden Research Center, San Jose, CA, USA
- affiliation (former): University of Houston, Department of Computer Science, TX, USA
Other persons with the same name
- D. Sivakumar — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i2]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 abs/2109.00702 (2021) - 2020
- [c44]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: 47-55 - [i1]Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar:
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. CoRR abs/2010.08418 (2020)
2010 – 2019
- 2019
- [c43]Qifan Wang, Bhargav Kanagal, Vijay Garg, D. Sivakumar:
Constructing a Comprehensive Events Database from the Web. CIKM 2019: 229-238 - [c42]Weiwei Kong, Christopher Liaw, Aranyak Mehta, D. Sivakumar:
A new dog learns old tricks: RL finds classic optimization algorithms. ICLR (Poster) 2019 - 2017
- [e2]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:
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. CEUR Workshop Proceedings, CEUR-WS.org 2017 [contents] - 2016
- [j12]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. SIAM J. Discret. Math. 30(4): 1978-1996 (2016) - 2012
- [j11]Anthony Bonato, Ravi Kumar, D. Sivakumar:
Introduction to the Special Issue on Algorithms and Models for the Web Graph. Internet Math. 8(1-2): 1 (2012) - [c41]Anirban Dasgupta
Sparse and Lopsided Set Disjointness via Information Theory. APPROX-RANDOM 2012: 517-528 - [c40]Anirban Dasgupta
Social sampling. KDD 2012: 235-243 - [c39]Vidhya Navalpakkam, Ravi Kumar, Lihong Li, D. Sivakumar:
Attention and Selection in Online Choice Tasks. UMAP 2012: 200-211 - 2011
- [c38]Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar:
Milgram-routing in social networks. WWW 2011: 725-734 - 2010
- [e1]Ravi Kumar, D. Sivakumar:
Algorithms and Models for the Web-Graph - 7th International Workshop, WAW 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings. Lecture Notes in Computer Science 6516, Springer 2010, ISBN 978-3-642-18008-8 [contents]
2000 – 2009
- 2009
- [c37]Silvio Lattanzi, D. Sivakumar:
Affiliation networks. STOC 2009: 427-434 - 2008
- [j10]T. S. Jayram, Ravi Kumar, D. Sivakumar:
The One-Way Communication Complexity of Hamming Distance. Theory Comput. 4(1): 129-135 (2008) - [c36]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: 1375-1376 - 2007
- [c35]Ravi Kumar, D. Sivakumar:
Communication Lower Bounds Via the Chromatic Number. FSTTCS 2007: 228-240 - 2006
- [j9]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani
On the Hardness of Approximating Multicut and Sparsest-Cut. Comput. Complex. 15(2): 94-114 (2006) - [j8]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing Partial Rankings. SIAM J. Discret. Math. 20(3): 628-648 (2006) - [c34]Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar:
Programmable clustering. PODS 2006: 348-354 - 2005
- [c33]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani
On the Hardness of Approximating Multicut and Sparsest-Cut. CCC 2005: 144-153 - [c32]Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang:
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM 2005: 2147-2158 - [c31]Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram:
Unweaving a web of documents. KDD 2005: 574-579 - [c30]Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Multi-structural databases. PODS 2005: 184-195 - [c29]Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Efficient Implementation of Large-Scale Multi-Structural Databases. VLDB 2005: 958-969 - 2004
- [j7]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): 702-732 (2004) - [c28]Sreenivas Gollapudi, D. Sivakumar:
Framework and algorithms for trend analysis in massive temporal data sets. CIKM 2004: 168-177 - [c27]Sreenivas Gollapudi, D. Sivakumar:
Data stream algorithms for scalable bandwidth management. ICC 2004: 1851-1856 - [c26]Sreenivas Gollapudi, D. Sivakumar:
A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS 2004: 138-147 - [c25]Ravi Kumar, Uma Mahadevan, D. Sivakumar:
A graph-theoretic approach to extract storylines from search results. KDD 2004: 216-225 - [c24]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 - 2003
- [j6]Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar:
Link Evolution: Analysis and Algorithms. Internet Math. 1(3): 277-304 (2003) - [j5]Ravi Kumar, D. Sivakumar:
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discret. Math. 16(3): 422-425 (2003) - [j4]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing Top k Lists. SIAM J. Discret. Math. 17(1): 134-160 (2003) - [c23]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003: 301-312 - [c22]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing top k lists. SODA 2003: 28-36 - [c21]T. S. Jayram, Ravi Kumar, D. Sivakumar:
Two applications of information complexity. STOC 2003: 673-682 - [c20]Ronald Fagin, Ravi Kumar, Kevin S. McCurley
Searching the workplace web. WWW 2003: 366-375 - 2002
- [j3]Stephen Dill, Ravi Kumar, Kevin S. McCurley
Self-similarity in the web. ACM Trans. Internet Techn. 2(3): 205-223 (2002) - [c19]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. CCC 2002: 53-57 - [c18]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Information Theory Methods in Communication Complexity. CCC 2002: 93-102 - [c17]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 - [c16]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 - [c15]Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 - [c14]Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Approximate counting of inversions in a data stream. STOC 2002: 370-379 - 2001
- [j2]Ravi Kumar, D. Sivakumar:
On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2): 641-648 (2001) - [c13]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001: 1-3 - [c12]Ravi Kumar, D. Sivakumar:
On polynomial approximation to the shortest lattice vector length. SODA 2001: 126-127 - [c11]Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
Sampling algorithms: lower bounds and applications. STOC 2001: 266-275 - [c10]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
A sieve algorithm for the shortest lattice vector problem. STOC 2001: 601-610 - [c9]Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins:
Self-similarity in the Web. VLDB 2001: 69-78 - [c8]Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar:
Rank aggregation methods for the Web. WWW 2001: 613-622 - 2000
- [j1]Funda Ergün, Ravi Kumar, D. Sivakumar:
Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000) - [c7]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
Random graph models for the web graph. FOCS 2000: 57-65 - [c6]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
The Web as a Graph. PODS 2000: 1-10
1990 – 1999
- 1999
- [c5]Ravi Kumar, D. Sivakumar:
Proofs, Codes, and Polynomial-Time Reducibilities. CCC 1999: 46-53 - [c4]Ravi Kumar, D. Sivakumar:
A Note on the Shortest Lattice Vector Problem. CCC 1999: 200-204 - [c3]Ravi Kumar, D. Sivakumar:
Roundness Estimation via Random Sampling. SODA 1999: 603-612 - 1996
- [c2]Ravi Kumar, D. Sivakumar:
Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996: 602-611 - 1995
- [c1]Ravi Kumar, D. Sivakumar:
On Self-Testing without the Generator Bottleneck. FSTTCS 1995: 248-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-17 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: