2 search results - page 1 / 1 » On the cell probe complexity of membership and perfect hashi... |
STOC
2001
ACM
14 years 4 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 1 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...