Encoding Two-Dimensional Range Top-k Queries
暂无分享,去创建一个
[1] S. Srinivasa Rao,et al. On Space Efficient Two Dimensional Range Minimum Data Structures , 2011, Algorithmica.
[2] Peter Bro Miltersen. Cell probe complexity-a survey , 1999 .
[3] Timothy M. Chan,et al. Adaptive and Approximate Orthogonal Range Counting , 2016, ACM Trans. Algorithms.
[4] Pawel Gawrychowski,et al. Optimal Encodings for Range Top- k k , Selection, and Min-Max , 2015, ICALP.
[5] Rajeev Raman,et al. Encodings for Range Selection and Top-k Queries , 2013, ESA.
[6] Rajeev Raman,et al. Asymptotically Optimal Encodings for Range Selection , 2014, FSTTCS.
[7] Alejandro López-Ortiz,et al. Online Sorted Range Reporting , 2009, ISAAC.
[8] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[9] Rajeev Raman,et al. Encoding 2D Range Maximum Queries , 2011, ISAAC.
[10] Greg N. Frederickson,et al. An Optimal Algorithm for Selection in a Min-Heap , 1993, Inf. Comput..
[11] Gerth Stølting Brodal,et al. The Encoding Complexity of Two Dimensional Range Minimum Data Structures , 2013, ESA.