D. Sivakumar

Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang, 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

YaoGAN: Learning Worst-case Competitive Algorithms from Self-generated Inputs

Aranyak Mehta, Di Wang, D. Sivakumar, 2019 .

Sigact News Complexity Theory Column 32 Introduction to Complexity Theory Column ?? Guest Column: Complexity of Svp | a Reader's Digest 1

D. Sivakumar, Lane A. HemaspaandraDept, 2022 .

Random graph models for the web graph

Eli Upfal, Andrew Tomkins, Prabhakar Raghavan, 2000, FOCS.

ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Yuval Rabani, Robert Krauthgamer, Ravi Kumar, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

Attention and selection in online choice tasks

Ravi Kumar, D. Sivakumar, Lihong Li, 2012, UMAP.

The Web as a graph

Eli Upfal, Prabhakar Raghavan, Ravi Kumar, 2000, PODS.

Ronald Fagin, Ravi Kumar, D. Sivakumar, 2003, SIGMOD '03.

Quasilinear Time Complexity Theory

D. Sivakumar, Kenneth W. Regan, Ashish V. Naik, 1994, STACS.

Affiliation networks

Silvio Lattanzi, D. Sivakumar, Silvio Lattanzi, 2009, STOC '09.

Sampling short lattice vectors and the closest lattice vector problem

Ravi Kumar, D. Sivakumar, Miklós Ajtai, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

On membership comparable sets

D. Sivakumar, D. Sivakumar, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

Milgram-routing in social networks

Silvio Lattanzi, D. Sivakumar, Alessandro Panconesi, 2011, WWW.

Sparse and Lopsided Set Disjointness via Information Theory

Anirban Dasgupta, Ravi Kumar, D. Sivakumar, 2012, APPROX-RANDOM.

Comparing Partial Rankings

Ronald Fagin, Ravi Kumar, D. Sivakumar, 2006, SIAM J. Discret. Math..

Stochastic models for the web graphRavi

E. Upfal, A. Tomkins, D. Sivakumar, 2000 .

Link Evolution: Analysis and Algorithms

Steve Chien, Ravi Kumar, D. Sivakumar, 2004, Internet Math..

Comparing top k lists

Ronald Fagin, Ravi Kumar, D. Sivakumar, 2003, SODA '03.

On the Hardness of Permanent

Jin-Yi Cai, D. Sivakumar, Aduri Pavan, 1999, STACS.

A graph-theoretic approach to extract storylines from search results

Ravi Kumar, D. Sivakumar, Uma Mahadevan, 2004, KDD.

Roundness estimation via random sampling

Ravi Kumar, D. Sivakumar, Ravi Kumar, 1999, SODA '99.

Algorithmic derandomization via complexity theory

D. Sivakumar, D. Sivakumar, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Pseudorandom generators, measure theory, and natural proofs

Jin-Yi Cai, D. Sivakumar, Kenneth W. Regan, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

Jin-Yi Cai, D. Sivakumar, D. Sivakumar, 1999, J. Comput. Syst. Sci..

Resolution of Hartmanis' conjecture for NL-hard sparse sets

Jin-Yi Cai, D. Sivakumar, D. Sivakumar, 1997, Theor. Comput. Sci..

On the Existence of Hard Sparse Sets under Weak Reductions

Jin-Yi Cai, D. Sivakumar, Ashish V. Naik, 1996, STACS.

The resolution of a Hartmanis conjecture

Jin-Yi Cai, D. Sivakumar, D. Sivakumar, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

A mechanism for equitable bandwidth allocation under QoS and budget constraints

Sreenivas Gollapudi, D. Sivakumar, D. Sivakumar, 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

Comparing and aggregating rankings with ties

Ronald Fagin, Mohammad Mahdian, Ravi Kumar, 2004, PODS '04.

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training pdf

Aranyak Mehta, Di Wang, D. Sivakumar, 2020, ArXiv.

Framework and algorithms for trend analysis in massive temporal data sets

Sreenivas Gollapudi, D. Sivakumar, D. Sivakumar, 2004, CIKM '04.

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

Dieter van Melkebeek, Kenneth W. Regan, Harry Buhrman, 2000, SIAM J. Comput..

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

Dieter van Melkebeek, D. Sivakumar, Kenneth W. Regan, 1998, STACS.

Hardness and hierarchy theorems for probabilistic quasi-polynomial time

Jin-Yi Cai, D. Sivakumar, Ajay Nerurkar, 1999, STOC '99.

Data stream algorithms for scalable bandwidth management

Sreenivas Gollapudi, D. Sivakumar, D. Sivakumar, 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

Approximate counting of inversions in a data stream

Ravi Kumar, D. Sivakumar, T. S. Jayram, 2002, STOC '02.

An Algorithmic View of Voting

Ronald Fagin, Ravi Kumar, D. Sivakumar, 2016, SIAM J. Discret. Math..

Sampling algorithms: lower bounds and applications

Ziv Bar-Yossef, D. Sivakumar, Ravi Kumar, 2001, STOC '01.

Proofs, codes, and polynomial-time reducibilities

Ravi Kumar, D. Sivakumar, Ravi Kumar, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

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

Ravi Kumar, D. Sivakumar, Miklós Ajtai, 2001, CaLC.

A note on the shortest lattice vector problem

Ravi Kumar, D. Sivakumar, Ravi Kumar, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Social sampling

Ravi Kumar, Anirban Dasgupta, D. Sivakumar, 2012, KDD.

On Self-Testing without the Generator Bottleneck

Ravi Kumar, D. Sivakumar, Ravi Kumar, 1995, FSTTCS.

The One-Way Communication Complexity of Hamming Distance

Ravi Kumar, D. Sivakumar, T. S. Jayram, 2008, Theory Comput..

Information theory methods in communication complexity

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Self-Testing without the Generator Bottleneck

Funda Ergün, Ravi Kumar, D. Sivakumar, 2000, SIAM J. Comput..