332 search results - page 9 / 67 » Space Complexity vs. Query Complexity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
ICDE
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...