Efficient Data Structures for Range Selections Problem
2013 ◽
Vol 756-759
◽
pp. 1387-1391
Keyword(s):
Building an efficient data structure for range selection problems is considered. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size . Our data structure is a practical linear space data structure that supports range selection queries in time with preprocessing time.
1991 ◽
Vol 01
(03)
◽
pp. 207-226
◽
Keyword(s):
1978 ◽
Vol 2
(6)
◽
pp. 420-428
◽
1992 ◽
Vol 14
(10)
◽
pp. 1035-1045
◽
Keyword(s):