Conference paper
Searching the workplace web
Ronald Fagin, Ravi Kumar, et al.
WWW 2003
Paper
On polynomial-factor approximations to the shortest lattice vector length
Abstract
For every constant ε > 0, we obtain a 2O(n(1/2+1/ε)) time randomized algorithm to approximate the length of the shortest vector in an n-dimensional lattice to within a factor of n3+ε.
Related
Ronald Fagin, Ravi Kumar, et al.
SIGMOD 2003
Ravi Kumar, Prabhakar Raghavan, et al.
Journal of Computer and System Sciences
Conference paper
A note on the set systems used for broadcast encryption
Ravi Kumar, Alexander Russell
SODA 1998