18 search results - page 2 / 4 » Lower bounds for predecessor searching in the cell probe mod... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
SODA
2010
ACM
14 years 2 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...