dblp.uni-trier.dewww.uni-trier.de

D. Sivakumar Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
69EESilvio Lattanzi, D. Sivakumar: Affiliation networks. STOC 2009: 427-434
2008
68EEG. Yamuna, D. Sivakumar: Secured and Lossless Watermarking Technique for Patent Infringement. ITNG 2008: 1295-1296
67EEAlexandr 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
66EEShumeet 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
65EET. S. Jayram, Ravi Kumar, D. Sivakumar: The One-Way Communication Complexity of Hamming Distance. Theory of Computing 4(1): 129-135 (2008)
2007
64EERavi Kumar, D. Sivakumar: Communication Lower Bounds Via the Chromatic Number. FSTTCS 2007: 228-240
2006
63EESreenivas Gollapudi, Ravi Kumar, D. Sivakumar: Programmable clustering. PODS 2006: 348-354
62EEShuchi 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)
61EERonald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing Partial Rankings. SIAM J. Discrete Math. 20(3): 628-648 (2006)
2005
60EEShuchi 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
59EESreenivas Gollapudi, D. Sivakumar, Aidong Zhang: Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. INFOCOM 2005: 2147-2158
58EERamanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram: Unweaving a web of documents. KDD 2005: 574-579
57EERonald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins: Multi-structural databases. PODS 2005: 184-195
56EERonald 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
55EESreenivas Gollapudi, D. Sivakumar: Framework and algorithms for trend analysis in massive temporal data sets. CIKM 2004: 168-177
54EESreenivas Gollapudi, D. Sivakumar: A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS 2004: 138-147
53EERavi Kumar, Uma Mahadevan, D. Sivakumar: A graph-theoretic approach to extract storylines from search results. KDD 2004: 216-225
52EERonald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58
51EEZiv 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)
2003
50EERonald Fagin, Ravi Kumar, D. Sivakumar: Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003: 301-312
49EERonald Fagin, Ravi Kumar, D. Sivakumar: Comparing top k lists. SODA 2003: 28-36
48EET. S. Jayram, Ravi Kumar, D. Sivakumar: Two applications of information complexity. STOC 2003: 673-682
47EERonald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson: Searching the workplace web. WWW 2003: 366-375
46 Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, D. Sivakumar: Link Evolution: Analysis and Algorithms. Internet Mathematics 1(3): (2003)
45EERavi Kumar, D. Sivakumar: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discrete Math. 16(3): 422-425 (2003)
44EERonald Fagin, Ravi Kumar, D. Sivakumar: Comparing Top k Lists. SIAM J. Discrete Math. 17(1): 134-160 (2003)
2002
43EEZiv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002: 209-218
42EED. Sivakumar: Algorithmic Derandomization via Complexity Theory. IEEE Conference on Computational Complexity 2002: 10
41EEMiklós Ajtai, Ravi Kumar, D. Sivakumar: Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. IEEE Conference on Computational Complexity 2002: 53-57
40EEZiv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002: 93-102
39EEZiv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan: Counting Distinct Elements in a Data Stream. RANDOM 2002: 1-10
38EEZiv Bar-Yossef, Ravi Kumar, D. Sivakumar: Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002: 623-632
37EEMiklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar: Approximate counting of inversions in a data stream. STOC 2002: 370-379
36EED. Sivakumar: Algorithmic derandomization via complexity theory. STOC 2002: 619-626
35EEStephen 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)
2001
34EEMiklós Ajtai, Ravi Kumar, D. Sivakumar: An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001: 1-3
33EERavi Kumar, D. Sivakumar: On polynomial approximation to the shortest lattice vector length. SODA 2001: 126-127
32EEZiv Bar-Yossef, Ravi Kumar, D. Sivakumar: Sampling algorithms: lower bounds and applications. STOC 2001: 266-275
31EEMiklós Ajtai, Ravi Kumar, D. Sivakumar: A sieve algorithm for the shortest lattice vector problem. STOC 2001: 601-610
30EEStephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins: Self-similarity in the Web. VLDB 2001: 69-78
29EECynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar: Rank aggregation methods for the Web. WWW 2001: 613-622
28EERavi Kumar, D. Sivakumar: On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2): 641-648 (2001)
2000
27 Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: Random graph models for the web graph. FOCS 2000: 57-65
26EERavi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal: The Web as a Graph. PODS 2000: 1-10
25 Funda Ergün, Ravi Kumar, D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000)
24 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)
23EEJin-yi Cai, D. Sivakumar: Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theor. Comput. Sci. 240(2): 257-269 (2000)
1999
22EERavi Kumar, D. Sivakumar: A Note on the Shortest Lattice Vector Problem. IEEE Conference on Computational Complexity 1999: 200-204
21EERavi Kumar, D. Sivakumar: Proofs, Codes, and Polynomial-Time Reducibilities. IEEE Conference on Computational Complexity 1999: 46-53
20EERavi Kumar, D. Sivakumar: Roundness Estimation via Random Sampling. SODA 1999: 603-612
19EEJin-yi Cai, Aduri Pavan, D. Sivakumar: On the Hardness of Permanent. STACS 1999: 90-99
18EEJin-yi Cai, Ajay Nerurkar, D. Sivakumar: Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735
17 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)
16 D. Sivakumar: On Membership Comparable Sets. J. Comput. Syst. Sci. 59(2): 270-280 (1999)
1998
15EEKenneth W. Regan, D. Sivakumar: Probabilistic Martingales and BPTIME Classes. IEEE Conference on Computational Complexity 1998: 186-
14EED. Sivakumar: On Membership Comparable Sets. IEEE Conference on Computational Complexity 1998: 2-7
13EEHarry 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
12EEHarry 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
11 Jin-yi Cai, D. Sivakumar: Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997: 62-71
10EEJin-yi Cai, D. Sivakumar, Martin Strauss: Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604
1996
9 Ravi Kumar, D. Sivakumar: Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996: 602-611
8EEJin-yi Cai, Ashish V. Naik, D. Sivakumar: On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318
1995
7 Kenneth W. Regan, D. Sivakumar, Jin-yi Cai: Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995: 26-35
6 Jin-yi Cai, D. Sivakumar: The Resolution of a Hartmanis Conjecture. FOCS 1995: 362-371
5EERavi Kumar, D. Sivakumar: On Self-Testing without the Generator Bottleneck. FSTTCS 1995: 248-262
4EEJin-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
3EEKenneth W. Regan, D. Sivakumar, Jin-yi Cai: Pseudorandom Generators, Measure Theory, and Natural Proofs Electronic Colloquium on Computational Complexity (ECCC) 2(6): (1995)
2EEAshish V. Naik, Kenneth W. Regan, D. Sivakumar: On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995)
1994
1EEAshish V. Naik, Kenneth W. Regan, D. Sivakumar: Quasilinear Time Complexity Theory. STACS 1994: 97-108

Coauthor Index

1Miklós Ajtai [31] [34] [37] [41]
2Mohamed Aly [66]
3Alexandr Andoni [67]
4Shumeet Baluja [66]
5Ziv Bar-Yossef [32] [38] [39] [40] [43] [51]
6Harry Buhrman [12] [13] [24]
7Jin-yi Cai [3] [4] [6] [7] [8] [10] [11] [17] [18] [19] [23]
8Shuchi Chawla [60] [62]
9Steve Chien [46]
10Stephen Dill [30] [35]
11Cynthia Dwork [29] [46]
12Funda Ergün [25]
13Ronald Fagin [44] [47] [49] [50] [52] [56] [57] [61] [67]
14Sreenivas Gollapudi [54] [55] [59] [63]
15Ramanathan V. Guha [57] [58]
16T. S. Jayram (Jayram S. Thathachar) [37] [39] [40] [43] [48] [51] [65]
17Yushi Jing [66]
18Phokion G. Kolaitis [56]
19Robert Krauthgamer [60] [62]
20Ravi Kumar (S. Ravi Kumar) [5] [9] [20] [21] [22] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [35] [37] [38] [39] [40] [41] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [56] [57] [58] [60] [61] [62] [63] [64] [65] [67]
21Shankar Kumar [66]
22Silvio Lattanzi [69]
23Richard J. Lipton [4]
24Luc Longpré [4]
25Uma Mahadevan [53]
26Mohammad Mahdian [52] [61]
27Kevin S. McCurley [30] [35] [47]
28Dieter van Melkebeek [12] [13] [24]
29Ashish V. Naik [1] [2] [8]
30Moni Naor [29]
31Ajay Nerurkar [18]
32Jasmine Novak [47] [56] [57]
33Mitsunori Ogihara (Mitsunori Ogiwara) [4]
34Mihai Patrascu [67]
35Aduri Pavan [19]
36Yuval Rabani [60] [62]
37Prabhakar Raghavan [26] [27]
38Sridhar Rajagopalan [26] [27] [30] [35]
39Deepak Ravichandran [66]
40Kenneth W. Regan [1] [2] [3] [4] [7] [12] [13] [15] [24]
41Rohan Seth [66]
42Daniel R. Simon [46]
43Martin Strauss (Martin J. Strauss) [10] [12] [13] [24]
44Ravi Sundaram [58]
45Andrew Tomkins [26] [27] [30] [35] [56] [57]
46John A. Tomlin [47]
47Luca Trevisan [39]
48Eli Upfal [26] [27]
49Erik Vee [52] [61]
50David P. Williamson [47]
51Jay Yagnik [66]
52G. Yamuna [68]
53Aidong Zhang [59]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)