138 search results - page 13 / 28 » Bit-probe lower bounds for succinct data structures |
174
click to vote
PODS
1995
ACM
15 years 7 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
140
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
146
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
144
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
134
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...