Sciweavers

STOC
2000
ACM
112views Algorithms» more  STOC 2000»
14 years 27 days ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
14 years 27 days ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis