The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

D. Sivakumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Miklós Ajtai, Ravi Kumar, D. Sivakumar
    An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:1-3 [Conf]
  2. Sreenivas Gollapudi, D. Sivakumar
    Framework and algorithms for trend analysis in massive temporal data sets. [Citation Graph (0, 0)][DBLP]
    CIKM, 2004, pp:168-177 [Conf]
  3. Miklós Ajtai, Ravi Kumar, D. Sivakumar
    Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:53-57 [Conf]
  4. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    Information Theory Methods in Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:93-102 [Conf]
  5. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
    On the Hardness of Approximating Multicut and Sparsest-Cut. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:144-153 [Conf]
  6. Ravi Kumar, D. Sivakumar
    Proofs, Codes, and Polynomial-Time Reducibilities. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:46-53 [Conf]
  7. Ravi Kumar, D. Sivakumar
    A Note on the Shortest Lattice Vector Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:200-204 [Conf]
  8. Kenneth W. Regan, D. Sivakumar
    Probabilistic Martingales and BPTIME Classes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:186-0 [Conf]
  9. D. Sivakumar
    Algorithmic Derandomization via Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:10- [Conf]
  10. D. Sivakumar
    On Membership Comparable Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:2-7 [Conf]
  11. Jin-yi Cai, D. Sivakumar
    Resolution of Hartmanis' Conjecture for NL-Hard Sparse Sets. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:62-71 [Conf]
  12. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    An Information Statistics Approach to Data Stream and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:209-218 [Conf]
  13. Jin-yi Cai, D. Sivakumar
    The Resolution of a Hartmanis Conjecture. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:362-371 [Conf]
  14. Jin-yi Cai, D. Sivakumar, Martin Strauss
    Constant Depth Circuits and the Lutz Hypothesis. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:595-604 [Conf]
  15. Ravi Kumar, D. Sivakumar
    Efficient Self-Testing/Self-Correction of Linear Recurrences. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:602-611 [Conf]
  16. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
    Random graph models for the web graph. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:57-65 [Conf]
  17. Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
    Pseudorandom Generators, Measure Theory, and Natural Proofs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:26-35 [Conf]
  18. Ravi Kumar, D. Sivakumar
    On Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:248-262 [Conf]
  19. Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
    Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2147-2158 [Conf]
  20. Sreenivas Gollapudi, D. Sivakumar
    A mechanism for equitable bandwidth allocation under QoS and budget constraints. [Citation Graph (0, 0)][DBLP]
    IWQoS, 2004, pp:138-147 [Conf]
  21. Ramanathan V. Guha, Ravi Kumar, D. Sivakumar, Ravi Sundaram
    Unweaving a web of documents. [Citation Graph (0, 0)][DBLP]
    KDD, 2005, pp:574-579 [Conf]
  22. Ravi Kumar, Uma Mahadevan, D. Sivakumar
    A graph-theoretic approach to extract storylines from search results. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:216-225 [Conf]
  23. Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
    Multi-structural databases. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:184-195 [Conf]
  24. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
    Comparing and Aggregating Rankings with Ties. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:47-58 [Conf]
  25. Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
    Programmable clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:348-354 [Conf]
  26. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
    The Web as a Graph. [Citation Graph (0, 18)][DBLP]
    PODS, 2000, pp:1-10 [Conf]
  27. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
    Counting Distinct Elements in a Data Stream. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:1-10 [Conf]
  28. Ronald Fagin, Ravi Kumar, D. Sivakumar
    Efficient similarity search and classification via rank aggregation. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:301-312 [Conf]
  29. Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
    Reductions in streaming algorithms, with an application to counting triangles in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:623-632 [Conf]
  30. Ronald Fagin, Ravi Kumar, D. Sivakumar
    Comparing top k lists. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:28-36 [Conf]
  31. Ravi Kumar, D. Sivakumar
    On polynomial approximation to the shortest lattice vector length. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:126-127 [Conf]
  32. Ravi Kumar, D. Sivakumar
    Roundness Estimation via Random Sampling. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:603-612 [Conf]
  33. Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
    A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:161-171 [Conf]
  34. Jin-yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
    Communication Complexity of Key Agreement on Small Ranges. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:38-49 [Conf]
  35. Jin-yi Cai, Ashish V. Naik, D. Sivakumar
    On the Existence of Hard Sparse Sets under Weak Reductions. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:307-318 [Conf]
  36. Jin-yi Cai, Aduri Pavan, D. Sivakumar
    On the Hardness of Permanent. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:90-99 [Conf]
  37. Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    Quasilinear Time Complexity Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:97-108 [Conf]
  38. Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
    Approximate counting of inversions in a data stream. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:370-379 [Conf]
  39. Miklós Ajtai, Ravi Kumar, D. Sivakumar
    A sieve algorithm for the shortest lattice vector problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:601-610 [Conf]
  40. Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar
    Sampling algorithms: lower bounds and applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:266-275 [Conf]
  41. Jin-yi Cai, Ajay Nerurkar, D. Sivakumar
    Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:726-735 [Conf]
  42. T. S. Jayram, Ravi Kumar, D. Sivakumar
    Two applications of information complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:673-682 [Conf]
  43. D. Sivakumar
    Algorithmic derandomization via complexity theory. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:619-626 [Conf]
  44. Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
    Self-similarity in the Web. [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:69-78 [Conf]
  45. Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins
    Efficient Implementation of Large-Scale Multi-Structural Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:958-969 [Conf]
  46. Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
    Rank aggregation methods for the Web. [Citation Graph (0, 0)][DBLP]
    WWW, 2001, pp:613-622 [Conf]
  47. Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson
    Searching the workplace web. [Citation Graph (0, 0)][DBLP]
    WWW, 2003, pp:366-375 [Conf]
  48. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
    On the Hardness of Approximating Multicut and Sparsest-Cut. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:2, pp:94-114 [Journal]
  49. Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
    Pseudorandom Generators, Measure Theory, and Natural Proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:6, pp:- [Journal]
  50. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:58, pp:- [Journal]
  51. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
    An information statistics approach to data stream and communication complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:702-732 [Journal]
  52. Jin-yi Cai, D. Sivakumar
    Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:2, pp:280-296 [Journal]
  53. D. Sivakumar
    On Membership Comparable Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:270-280 [Journal]
  54. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:576-601 [Journal]
  55. Funda Ergün, Ravi Kumar, D. Sivakumar
    Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1630-1651 [Journal]
  56. Ronald Fagin, Ravi Kumar, D. Sivakumar
    Comparing Top k Lists. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:134-160 [Journal]
  57. Ravi Kumar, D. Sivakumar
    On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:3, pp:422-425 [Journal]
  58. Jin-yi Cai, D. Sivakumar
    Resolution of Hartmanis' conjecture for NL-hard sparse sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:257-269 [Journal]
  59. Ravi Kumar, D. Sivakumar
    On the unique shortest lattice vector problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:641-648 [Journal]
  60. Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    On Quasilinear-Time Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:325-349 [Journal]
  61. Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins
    Self-similarity in the web. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Internet Techn., 2002, v:2, n:3, pp:205-223 [Journal]

  62. Communication Lower Bounds Via the Chromatic Number. [Citation Graph (, )][DBLP]


  63. Secured and Lossless Watermarking Technique for Patent Infringement. [Citation Graph (, )][DBLP]


  64. Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). [Citation Graph (, )][DBLP]


  65. Affiliation networks. [Citation Graph (, )][DBLP]


  66. Video suggestion and discovery for youtube: taking random walks through the view graph. [Citation Graph (, )][DBLP]


  67. Text Classification through Time - Efficient Label Propagation in Time-Based Graphs. [Citation Graph (, )][DBLP]


Search in 0.441secs, Finished in 0.443secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002