2252 search results - page 6 / 451 » Lower Bounds for Dynamic Algorithms |
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
EUROPAR
1998
Springer
13 years 11 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
17
Voted
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
JPDC
1998
13 years 7 months ago
1998
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...