Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarD. Sivakumar
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 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 Szekely, Raphaël Troncy, Michael J. 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
- [j20]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. SIAM J. Discrete Math. 30(4): 1978-1996 (2016) - 2013
- [j19]M. Manohar, Jomy Joseph, T. Selvaraj, D. Sivakumar:
Application of desirability-function and RSM to optimise the multi-objectives while turning Inconel 718 using coated carbide tools. IJMTM 27(4/5/6): 218-237 (2013) - [j18]V. Kalaichelvi, R. Karthikeyan, D. Sivakumar:
Analysis of gas metal arc welding process using GA tuned fuzzy rule based system. Journal of Intelligent and Fuzzy Systems 25(2): 429-440 (2013) - 2012
- [j17]Anthony Bonato, Ravi Kumar, D. Sivakumar:
Introduction to the Special Issue on Algorithms and Models for the Web Graph. Internet Mathematics 8(1-2): 1 (2012) - [c59]Anirban Dasgupta, Ravi Kumar, D. Sivakumar:
Sparse and Lopsided Set Disjointness via Information Theory. APPROX-RANDOM 2012: 517-528 - [c58]
- [c57]Vidhya Navalpakkam, Ravi Kumar, Lihong Li, D. Sivakumar:
Attention and Selection in Online Choice Tasks. UMAP 2012: 200-211 - 2011
- [c56]Rohan Seth, Michele Covell, Deepak Ravichandran, D. Sivakumar, Shumeet Baluja:
A Tale of Two (Similar) Cities - Inferring City Similarity through Geo-spatial Query Log Analysis. KDIR 2011: 179-189 - [c55]Silvio Lattanzi, Alessandro Panconesi, D. Sivakumar:
Milgram-routing in social networks. WWW 2011: 725-734 - 2010
- [j16]D. Rathikarani, D. Sivakumar:
Design of an optimal PI controller for a non-linear process using genetic algorithm. IJAAC 4(4): 480-503 (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
- [c54]Shumeet Baluja, Deepak Ravichandran, D. Sivakumar:
Text Classification through Time - Efficient Label Propagation in Time-Based Graphs. KDIR 2009: 174-182 - [c53]
- 2008
- [j15]T. S. Jayram, Ravi Kumar, D. Sivakumar:
The One-Way Communication Complexity of Hamming Distance. Theory of Computing 4(1): 129-135 (2008) - [c52]
- [c51]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 - [c50]Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar, Deepak Ravichandran, Mohamed Aly:
Video suggestion and discovery for youtube: taking random walks through the view graph. WWW 2008: 895-904 - 2007
- [c49]
- 2006
- [j14]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar:
On the Hardness of Approximating Multicut and Sparsest-Cut. Computational Complexity 15(2): 94-114 (2006) - [j13]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing Partial Rankings. SIAM J. Discrete Math. 20(3): 628-648 (2006) - [c48]
- 2005
- [c47]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar:
On the Hardness of Approximating Multicut and Sparsest-Cut. IEEE Conference on Computational Complexity 2005: 144-153 - [c46]Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang:
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM 2005: 2147-2158 - [c45]Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram:
Unweaving a web of documents. KDD 2005: 574-579 - [c44]Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins:
Multi-structural databases. PODS 2005: 184-195 - [c43]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
- [j12]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) - [c42]Sreenivas Gollapudi, D. Sivakumar:
Framework and algorithms for trend analysis in massive temporal data sets. CIKM 2004: 168-177 - [c41]Sreenivas Gollapudi, D. Sivakumar:
Data stream algorithms for scalable bandwidth management. ICC 2004: 1851-1856 - [c40]Sreenivas Gollapudi, D. Sivakumar:
A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS 2004: 138-147 - [c39]Ravi Kumar, Uma Mahadevan, D. Sivakumar:
A graph-theoretic approach to extract storylines from search results. KDD 2004: 216-225 - [c38]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 - 2003
- [j11]Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar:
Link Evolution: Analysis and Algorithms. Internet Mathematics 1(3): 277-304 (2003) - [j10]Ravi Kumar, D. Sivakumar:
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discrete Math. 16(3): 422-425 (2003) - [j9]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing Top k Lists. SIAM J. Discrete Math. 17(1): 134-160 (2003) - [c37]Ronald Fagin, Ravi Kumar, D. Sivakumar:
Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003: 301-312 - [c36]
- [c35]T. S. Jayram, Ravi Kumar, D. Sivakumar:
Two applications of information complexity. STOC 2003: 673-682 - [c34]Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson:
Searching the workplace web. WWW 2003: 366-375 - 2002
- [j8]Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins:
Self-similarity in the web. ACM Trans. Internet Techn. 2(3): 205-223 (2002) - [c33]D. Sivakumar:
Algorithmic Derandomization via Complexity Theory. IEEE Conference on Computational Complexity 2002: 10 - [c32]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. IEEE Conference on Computational Complexity 2002: 53-57 - [c31]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102 - [c30]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar:
An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218 - [c29]Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan:
Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10 - [c28]Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632 - [c27]Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar:
Approximate counting of inversions in a data stream. STOC 2002: 370-379 - [c26]
- 2001
- [j7]Ravi Kumar, D. Sivakumar:
On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2): 641-648 (2001) - [c25]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001: 1-3 - [c24]Ravi Kumar, D. Sivakumar:
On polynomial approximation to the shortest lattice vector length. SODA 2001: 126-127 - [c23]Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar:
Sampling algorithms: lower bounds and applications. STOC 2001: 266-275 - [c22]Miklós Ajtai, Ravi Kumar, D. Sivakumar:
A sieve algorithm for the shortest lattice vector problem. STOC 2001: 601-610 - [c21]Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins:
Self-similarity in the Web. VLDB 2001: 69-78 - [c20]Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar:
Rank aggregation methods for the Web. WWW 2001: 613-622 - 2000
- [j6]Funda Ergün, Ravi Kumar, D. Sivakumar:
Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000) - [j5]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. SIAM J. Comput. 30(2): 576-601 (2000) - [j4]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theor. Comput. Sci. 240(2): 257-269 (2000) - [c19]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
Random graph models for the web graph. FOCS 2000: 57-65 - [c18]Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal:
The Web as a Graph. PODS 2000: 1-10
1990 – 1999
- 1999
- [j3]Jin-yi Cai, D. Sivakumar:
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. J. Comput. Syst. Sci. 58(2): 280-296 (1999) - [j2]
- [c17]Ravi Kumar, D. Sivakumar:
Proofs, Codes, and Polynomial-Time Reducibilities. IEEE Conference on Computational Complexity 1999: 46-53 - [c16]Ravi Kumar, D. Sivakumar:
A Note on the Shortest Lattice Vector Problem. IEEE Conference on Computational Complexity 1999: 200-204 - [c15]
- [c14]
- [c13]Jin-yi Cai, Ajay Nerurkar, D. Sivakumar:
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735 - 1998
- [c12]
- [c11]Kenneth W. Regan, D. Sivakumar:
Probabilistic Martingales and BPTIME Classes. IEEE Conference on Computational Complexity 1998: 186- - [c10]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss:
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). STACS 1998: 161-171 - [i2]Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, Martin Strauss, D. Sivakumar:
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem. Electronic Colloquium on Computational Complexity (ECCC) 5(58) (1998) - 1997
- [c9]Jin-yi Cai, D. Sivakumar:
Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997: 62-71 - [c8]Jin-yi Cai, D. Sivakumar, Martin Strauss:
Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604 - 1996
- [c7]Ravi Kumar, D. Sivakumar:
Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996: 602-611 - [c6]Jin-yi Cai, Ashish V. Naik, D. Sivakumar:
On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318 - 1995
- [j1]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995) - [c5]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995: 26-35 - [c4]
- [c3]
- [c2]Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar:
Communication Complexity of Key Agreement on Small Ranges. STACS 1995: 38-49 - [i1]Kenneth W. Regan, D. Sivakumar, Jin-yi Cai:
Pseudorandom Generators, Measure Theory, and Natural Proofs. Electronic Colloquium on Computational Complexity (ECCC) 2(6) (1995) - 1994
- [c1]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
Quasilinear Time Complexity Theory. STACS 1994: 97-108
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-03-07 10:07 CET by the dblp team