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