Algorithmic derandomization via complexity theory
- D. Sivakumar
- 2002
- CCC 2002
Publications
Date
Featured collections
Popular topics
36 results for D. Sivakumar
Approximate counting of inversions in a data stream
- Miklós Ajtai
- T.S. Jayram
- et al.
- 2002
- STOC 2002
Algorithmic derandomization via complexity theory
- D. Sivakumar
- 2002
- STOC 2002
Reductions in streaming algorithms, with an application to counting triangles in graphs
- Ziv Bar-Yossef
- Ravi Kumar
- et al.
- 2002
- SODA 2002
Information theory methods in communication complexity
- Ziv Bar-Yossef
- T.S. Jayram
- et al.
- 2002
- Proceedings of the Annual IEEE Conference on Computational Complexity
On polynomial approximation to the shortest lattice vector length
- Ravi Kumar
- D. Sivakumar
- 2001
- ACM-SIAM 2001
Self-similarity in the web
- Stephen Dill
- Ravi Kumar
- et al.
- 2001
- VLDB 2001
A sieve algorithm for the shortest lattice vector problem
- Miklos Ajtai
- R. Kumar
- et al.
- 2001
- STOC 2001
Rank aggregation methods for the web
- Cynthia Dwork
- Ravi Kumar
- et al.
- 2001
- WWW 2001
Stochastic models for the web graph
- R. Kumar
- Prabhakar Raghavan
- et al.
- 2000
- FOCS 2000