Conference paper
Web as a graph
R. Kumar, Prabhakar Raghavan, et al.
SIGMOD/PODS/ 2000
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
Ravi Kumar, Prabhakar Raghavan, et al.
Computer Networks
Conference paper
Discovering large dense subgraphs in massive graphs
David Gibson, Ravi Kumar, et al.
VLDB 2005
Conference paper
Stochastic models for the web graph
R. Kumar, Prabhakar Raghavan, et al.
FOCS 2000