| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. D. Sivakumar 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 R. Guha , Ravi Kumar , D. Sivakumar, Ravi Sundaram : Unweaving a web of documents. KDD 2005 : 574-579 Ronald Fagin , R. Guha , Ravi Kumar , Jasmine Novak , D. Sivakumar, Andrew Tomkins : Multi-structural databases. PODS 2005 : 184-195 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 Sreenivas Gollapudi , D. Sivakumar: Framework and algorithms for trend analysis in massive temporal data sets. CIKM 2004 : 168-177 Sreenivas Gollapudi , D. Sivakumar: A mechanism for equitable bandwidth allocation under QoS and budget constraints. IWQoS 2004 : 138-147 Ravi Kumar , Uma Mahadevan , D. Sivakumar: A graph-theoretic approach to extract storylines from search results. KDD 2004 : 216-225 Ronald Fagin , Ravi Kumar , Mohammad Mahdian , D. Sivakumar, Erik Vee : Comparing and Aggregating Rankings with Ties. PODS 2004 : 47-58 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) Ronald Fagin , Ravi Kumar , D. Sivakumar: Efficient similarity search and classification via rank aggregation. SIGMOD Conference 2003 : 301-312 Ronald Fagin , Ravi Kumar , D. Sivakumar: Comparing top k lists. SODA 2003 : 28-36 T. S. Jayram , Ravi Kumar , D. Sivakumar: Two applications of information complexity. STOC 2003 : 673-682 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 Ravi Kumar , D. Sivakumar: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. SIAM J. Discrete Math. 16 (3): 422-425 (2003) Ronald Fagin , Ravi Kumar , D. Sivakumar: Comparing Top k Lists. SIAM J. Discrete Math. 17 (1): 134-160 (2003) Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar , D. Sivakumar: An Information Statistics Approach to Data Stream and Communication Complexity. FOCS 2002 : 209-218 D. Sivakumar: Algorithmic Derandomization via Complexity Theory. IEEE Conference on Computational Complexity 2002 : 10 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 Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar , D. Sivakumar: Information Theory Methods in Communication Complexity. IEEE Conference on Computational Complexity 2002 : 93-102 Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar , D. Sivakumar, Luca Trevisan : Counting Distinct Elements in a Data Stream. RANDOM 2002 : 1-10 Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar: Reductions in streaming algorithms, with an application to counting triangles in graphs. SODA 2002 : 623-632 Miklós Ajtai , T. S. Jayram , Ravi Kumar , D. Sivakumar: Approximate counting of inversions in a data stream. STOC 2002 : 370-379 D. Sivakumar: Algorithmic derandomization via complexity theory. STOC 2002 : 619-626 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) Miklós Ajtai , Ravi Kumar , D. Sivakumar: An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. CaLC 2001 : 1-3 Ravi Kumar , D. Sivakumar: On polynomial approximation to the shortest lattice vector length. SODA 2001 : 126-127 Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar: Sampling algorithms: lower bounds and applications. STOC 2001 : 266-275 Miklós Ajtai , Ravi Kumar , D. Sivakumar: A sieve algorithm for the shortest lattice vector problem. STOC 2001 : 601-610 Stephen Dill , Ravi Kumar , Kevin S. McCurley , Sridhar Rajagopalan , D. Sivakumar, Andrew Tomkins : Self-similarity in the Web. VLDB 2001 : 69-78 Cynthia Dwork , Ravi Kumar , Moni Naor , D. Sivakumar: Rank aggregation methods for the Web. WWW 2001 : 613-622 Ravi Kumar , D. Sivakumar: On the unique shortest lattice vector problem. Theor. Comput. Sci. 255 (1-2): 641-648 (2001) Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar, Andrew Tomkins , Eli Upfal : Random graph models for the web graph. FOCS 2000 : 57-65 Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar, Andrew Tomkins , Eli Upfal : The Web as a Graph. PODS 2000 : 1-10 Funda Ergün , Ravi Kumar , D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29 (5): 1630-1651 (2000) 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) Jin-yi Cai , D. Sivakumar: Resolution of Hartmanis' conjecture for NL-hard sparse sets. Theor. Comput. Sci. 240 (2): 257-269 (2000) Ravi Kumar , D. Sivakumar: A Note on the Shortest Lattice Vector Problem. IEEE Conference on Computational Complexity 1999 : 200-204 Ravi Kumar , D. Sivakumar: Proofs, Codes, and Polynomial-Time Reducibilities. IEEE Conference on Computational Complexity 1999 : 46-53 Ravi Kumar , D. Sivakumar: Roundness Estimation via Random Sampling. SODA 1999 : 603-612 Jin-yi Cai , Aduri Pavan , D. Sivakumar: On the Hardness of Permanent. STACS 1999 : 90-99 Jin-yi Cai , Ajay Nerurkar , D. Sivakumar: Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999 : 726-735 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) D. Sivakumar: On Membership Comparable Sets. J. Comput. Syst. Sci. 59 (2): 270-280 (1999) Kenneth W. Regan , D. Sivakumar: Probabilistic Martingales and BPTIME Classes. IEEE Conference on Computational Complexity 1998 : 186- D. Sivakumar: On Membership Comparable Sets. IEEE Conference on Computational Complexity 1998 : 2-7 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 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) Jin-yi Cai , D. Sivakumar: Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997 : 62-71 Jin-yi Cai , D. Sivakumar, Martin Strauss : Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997 : 595-604 Ravi Kumar , D. Sivakumar: Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996 : 602-611 Jin-yi Cai , Ashish V. Naik , D. Sivakumar: On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996 : 307-318 Kenneth W. Regan , D. Sivakumar, Jin-yi Cai : Pseudorandom Generators, Measure Theory, and Natural Proofs. FOCS 1995 : 26-35 Jin-yi Cai , D. Sivakumar: The Resolution of a Hartmanis Conjecture. FOCS 1995 : 362-371 Ravi Kumar , D. Sivakumar: On Self-Testing without the Generator Bottleneck. FSTTCS 1995 : 248-262 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 Kenneth W. Regan , D. Sivakumar, Jin-yi Cai : Pseudorandom Generators, Measure Theory, and Natural Proofs Electronic Colloquium on Computational Complexity (ECCC) 2 (6): (1995) Ashish V. Naik , Kenneth W. Regan , D. Sivakumar: On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148 (2): 325-349 (1995) Ashish V. Naik , Kenneth W. Regan , D. Sivakumar: Quasilinear Time Complexity Theory. STACS 1994 : 97-108 1 [ 31 ] [ 34 ] [ 37 ] [ 41 ] 2 [ 32 ] [ 38 ] [ 39 ] [ 40 ] [ 43 ] [ 50 ] 3 [ 12 ] [ 13 ] [ 24 ] 4 [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 11 ] [ 17 ] [ 18 ] [ 19 ] [ 23 ] 5 [ 58 ] 6 [ 30 ] [ 35 ] 7 [ 29 ] 8 [ 25 ] 9 [ 44 ] [ 46 ] [ 48 ] [ 49 ] [ 51 ] [ 55 ] [ 56 ] 10 [ 53 ] [ 54 ] 11 [ 56 ] [ 57 ] 12 [ 37 ] [ 39 ] [ 40 ] [ 43 ] [ 47 ] [ 50 ] 13 [ 55 ] 14 [ 58 ] 15 [ 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 ] [ 55 ] [ 56 ] [ 57 ] [ 58 ] 16 [ 4 ] 17 [ 4 ] 18 [ 52 ] 19 [ 51 ] 20 [ 30 ] [ 35 ] [ 46 ] 21 [ 12 ] [ 13 ] [ 24 ] 22 [ 1 ] [ 2 ] [ 8 ] 23 [ 29 ] 24 [ 18 ] 25 [ 46 ] [ 55 ] [ 56 ] 26 [ 4 ] 27 [ 19 ] 28 [ 58 ] 29 [ 26 ] [ 27 ] 30 [ 26 ] [ 27 ] [ 30 ] [ 35 ] 31 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] [ 12 ] [ 13 ] [ 15 ] [ 24 ] 32 [ 10 ] [ 12 ] [ 13 ] [ 24 ] 33 [ 57 ] 34 [ 26 ] [ 27 ] [ 30 ] [ 35 ] [ 55 ] [ 56 ] 35 [ 46 ] 36 [ 39 ] 37 [ 26 ] [ 27 ] 38 [ 51 ] 39 [ 46 ]  ©2006 Association for Computing Machinery |
