# D. Sivakumar

According to our database

Collaborative distances:

^{1}, D. Sivakumar authored at least 75 papers between 1995 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Secure cluster-based data aggregation in wireless sensor networks with aid of ECC.

Int. J. Bus. Inf. Syst., 2019

A new dog learns old tricks: RL finds classic optimization algorithms.

Proceedings of the 7th International Conference on Learning Representations, 2019

Constructing a Comprehensive Events Database from the Web.

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Certain investigations on effective rate adaptation in cognitive radio with channel characteristics.

Int. J. Netw. Virtual Organisations, 2018

2016

An Algorithmic View of Voting.

SIAM J. Discret. Math., 2016

2013

Analysis of gas metal arc welding process using GA tuned fuzzy rule based system.

J. Intell. Fuzzy Syst., 2013

Application of desirability-function and RSM to optimise the multi-objectives while turning Inconel 718 using coated carbide tools.

Int. J. Manuf. Technol. Manag., 2013

2012

Introduction to the Special Issue on Algorithms and Models for the Web Graph.

Internet Math., 2012

Attention and Selection in Online Choice Tasks.

Proceedings of the User Modeling, Adaptation, and Personalization, 2012

Social sampling.

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Sparse and Lopsided Set Disjointness via Information Theory.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Milgram-routing in social networks.

Proceedings of the 20th International Conference on World Wide Web, 2011

A Tale of Two (Similar) Cities - Inferring City Similarity through Geo-spatial Query Log Analysis.

Proceedings of the KDIR 2011, 2011

2010

Design of an optimal PI controller for a non-linear process using genetic algorithm.

IJAAC, 2010

2009

Affiliation networks.

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Text Classification through Time - Efficient Label Propagation in Time-Based Graphs.

Proceedings of the KDIR 2009 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Funchal, 2009

2008

The One-Way Communication Complexity of Hamming Distance.

Theory Comput., 2008

Video suggestion and discovery for youtube: taking random walks through the view graph.

Proceedings of the 17th International Conference on World Wide Web, 2008

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

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Secured and Lossless Watermarking Technique for Patent Infringement.

Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

2007

Communication Lower Bounds Via the Chromatic Number.

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Comparing Partial Rankings.

SIAM J. Discret. Math., 2006

On the Hardness of Approximating Multicut and Sparsest-Cut.

Comput. Complex., 2006

Programmable clustering.

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005

Efficient Implementation of Large-Scale Multi-Structural Databases.

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Multi-structural databases.

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Unweaving a web of documents.

Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004

An information statistics approach to data stream and communication complexity.

J. Comput. Syst. Sci., 2004

Comparing and Aggregating Rankings with Ties.

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

A graph-theoretic approach to extract storylines from search results.

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

A mechanism for equitable bandwidth allocation under QoS and budget constraints.

Proceedings of the Quality of Service, 2004

Data stream algorithms for scalable bandwidth management.

Proceedings of IEEE International Conference on Communications, 2004

Framework and algorithms for trend analysis in massive temporal data sets.

Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

2003

On Polynomial-Factor Approximations to the Shortest Lattice Vector Length.

SIAM J. Discret. Math., 2003

Comparing Top k Lists.

SIAM J. Discret. Math., 2003

Link Evolution: Analysis and Algorithms.

Internet Math., 2003

Searching the workplace web.

Proceedings of the Twelfth International World Wide Web Conference, 2003

Two applications of information complexity.

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Efficient similarity search and classification via rank aggregation.

Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

2002

Self-similarity in the web.

ACM Trans. Internet Techn., 2002

Algorithmic derandomization via complexity theory.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Approximate counting of inversions in a data stream.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Reductions in streaming algorithms, with an application to counting triangles in graphs.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Counting Distinct Elements in a Data Stream.

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Information Theory Methods in Communication Complexity.

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

Sampling Short Lattice Vectors and the Closest Lattice Vector Problem.

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

On the unique shortest lattice vector problem.

Theor. Comput. Sci., 2001

Rank aggregation methods for the Web.

Proceedings of the Tenth International World Wide Web Conference, 2001

Sampling algorithms: lower bounds and applications.

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A sieve algorithm for the shortest lattice vector problem.

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On polynomial approximation to the shortest lattice vector length.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem.

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

Resolution of Hartmanis' conjecture for NL-hard sparse sets.

Theor. Comput. Sci., 2000

Self-Testing without the Generator Bottleneck.

SIAM J. Comput., 2000

The Web as a Graph.

Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Random graph models for the web graph.

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

On Membership Comparable Sets.

J. Comput. Syst. Sci., 1999

Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis.

J. Comput. Syst. Sci., 1999

Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time.

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On the Hardness of Permanent.

Proceedings of the STACS 99, 1999

Roundness Estimation via Random Sampling.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Note on the Shortest Lattice Vector Problem.

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

Proofs, Codes, and Polynomial-Time Reducibilities.

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem

Electronic Colloquium on Computational Complexity (ECCC), 1998

A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).

Proceedings of the STACS 98, 1998

Probabilistic Martingales and BPTIME Classes.

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

Constant Depth Circuits and the Lutz Hypothesis.

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

On the Existence of Hard Sparse Sets under Weak Reductions.

Proceedings of the STACS 96, 1996

Efficient Self-Testing/Self-Correction of Linear Recurrences.

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

On Quasilinear-Time Complexity Theory.

Theor. Comput. Sci., 1995

Pseudorandom Generators, Measure Theory, and Natural Proofs

Electronic Colloquium on Computational Complexity (ECCC), 1995

Communication Complexity of Key Agreement on Small Ranges.

Proceedings of the STACS 95, 1995

On Self-Testing without the Generator Bottleneck.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

The Resolution of a Hartmanis Conjecture.

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995