scholarly journals Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees

Algorithmica ◽  
2014 ◽  
Vol 74 (1) ◽  
pp. 344-366
Author(s):  
Stephane Durocher ◽  
Rahul Shah ◽  
Matthew Skala ◽  
Sharma V. Thankachan
2013 ◽  
Vol 756-759 ◽  
pp. 1387-1391
Author(s):  
Xiao Dong Wang ◽  
Jun Tian

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.


2013 ◽  
Vol 55 (4) ◽  
pp. 719-741 ◽  
Author(s):  
Timothy M. Chan ◽  
Stephane Durocher ◽  
Kasper Green Larsen ◽  
Jason Morrison ◽  
Bryan T. Wilkinson

1987 ◽  
Vol 2 (2) ◽  
pp. 113-126 ◽  
Author(s):  
Bernard Chazelle ◽  
Herbert Edelsbrunner

Algorithmica ◽  
2014 ◽  
Vol 72 (4) ◽  
pp. 901-913 ◽  
Author(s):  
Timothy M. Chan ◽  
Stephane Durocher ◽  
Matthew Skala ◽  
Bryan T. Wilkinson

Author(s):  
Timothy M. Chan ◽  
Stephane Durocher ◽  
Matthew Skala ◽  
Bryan T. Wilkinson

2020 ◽  
Vol 822 ◽  
pp. 15-22
Author(s):  
Paniz Abedin ◽  
Arnab Ganguly ◽  
Wing-Kai Hon ◽  
Kotaro Matsuda ◽  
Yakov Nekrich ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document