| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. D. Sivakumar 22 S. Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , D. Sivakumar, Andrew Tomkins , Eli Upfal : The Web as a Graph. PODS 2000 : 1-10 21 Funda Ergün , S. Ravi Kumar , D. Sivakumar: Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29 (5): 1630-1651 (2000) 20 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) 19 Jin-yi Cai , D. Sivakumar: Resolution of Hartmanis' conjecture for NL-hard sparse sets. TCS 240 (2): 257-269 (2000) 18 S. Ravi Kumar , D. Sivakumar: Roundness Estimation via Random Sampling. SODA 1999 : 603-612 17 Jin-yi Cai , Aduri Pavan , D. Sivakumar: On the Hardness of Permanent. STACS 1999 : 90-99 16 Jin-yi Cai , Ajay Nerurkar , D. Sivakumar: Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999 : 726-735 15 Jin-yi Cai , D. Sivakumar: Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. JCSS 58 (2): 280-296 (1999) 14 D. Sivakumar: On Membership Comparable Sets. JCSS 59 (2): 270-280 (1999) 13 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 12 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 (058): (1998) 11 Jin-yi Cai , D. Sivakumar: Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. COCOON 1997 : 62-71 10 Jin-yi Cai , D. Sivakumar, Martin Strauss : Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997 : 595-604 9 S. Ravi Kumar , D. Sivakumar: Efficient Self-Testing/Self-Correction of Linear Recurrences. FOCS 1996 : 602-611 8 Jin-yi Cai , Ashish V. Naik , D. Sivakumar: On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996 : 307-318 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 5 S. Ravikumar , D. Sivakumar: On Self-Testing without the Generator Bottleneck. FSTTCS 1995 : 248-262 4 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 3 Kenneth W. Regan , D. Sivakumar, Jin-yi Cai : Pseudorandom Generators, Measure Theory, and Natural Proofs. Electronic Colloquium on Computational Complexity (ECCC) 2 (006): (1995) 2 Ashish V. Naik , Kenneth W. Regan , D. Sivakumar: On Quasilinear-Time Complexity Theory. TCS 148 (2): 325-349 (1995) 1 Ashish V. Naik , Kenneth W. Regan , D. Sivakumar: Quasilinear Time Complexity Theory. STACS 1994 : 97-108 DiSC'01 Copyright ©2002 ACM Inc. |
