Data structures for range median queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 822-831

  Brodal, Gerth Stølting ^a   Jørgensen, Allan Grønlund ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN DATA; DYNAMIC DATA STRUCTURE; LINEAR SPACES; RANGE MEDIAN; STATIC AND DYNAMIC;

COMPUTATION THEORY;

DATA STRUCTURES;

EID: 75649134609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_83     Document Type: Conference Paper

References (16)

1. Krizanc, D., Morin, P., Smid, M.H.M.: Range mode and range median queries on lists and trees. Nord. J. Comput. 12(1), 1-17 (2005)
2. Petersen, H.: Improved bounds for range mode and range median queries. In: Proc. 34th Conference on Current Trends in Theory and Practice of Computer Science, pp. 418-423 (2008)
3. Petersen, H., Grabowski, S.: Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109(4), 225-228 (2009)
4. Gfeller, B., Sanders, P.: Towards optimal range medians. In: Proc. 36th International Colloquium on Automata, Languages and Programming, pp. 475-486 (2009)
5. Gagie, T., Puglisi, S.J., Turpin, A.: Range quantile queries: Another virtue of wavelet trees. In: Proc. 16th String Processing and Information Retrieval Symposium, pp. 1-6 (2009)
6. Har-Peled, S., Muthukrishnan, S.: Range medians. In: Proc. 16th Annual European Symposium on Algorithms, pp. 503-514 (2008)
7. Pǎtraşcu, M.: Lower bounds for 2-dimensional range counting. In: Proc. 39th ACM Symposium on Theory of Computing, pp. 40-46 (2007)
8. Pǎtraşcu, M.: (Data) STRUCTURES. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 434-443 (2008)
9. JáJá, J., Mortensen, C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Proc. 15th International Symposium on Algorithms and Computation, pp. 558-568 (2004)
10. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. In: Proc. 10th International Workshop on Algorithms and Data Structures, pp. 15-26 (2007)
11. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proc. 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 534-543. IEEE Computer Society, Los Alamitos (1998)
12. Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1(2), 133-162 (1986)
13. Jacobson, G.J.: Succinct static data structures. PhD thesis. Carnegie Mellon University, Pittsburgh, PA, USA (1988)
14. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory 10, 99-127 (1977)
15. Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. In: Proc. 4th Annual ACM symposium on Theory of computing, pp. 137-142 (1972)
16. Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM Journal on Computing 32(6), 1488-1508 (2003)