315 search results - page 7 / 63 » Cell-probe lower bounds for the partial match problem |
STACS
1999
Springer
14 years 25 days 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...
SWAT
1994
Springer
14 years 19 days ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
ICALP
2011
Springer
13 years 1 days ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
FOSSACS
2007
Springer
14 years 2 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...