On space efficient two dimensional range minimum data structures

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

Volumn 6347 LNCS, Issue PART 2, 2010, Pages 171-182

  Brodal, Gerth Stølting ^a   Davoodi, Pooya ^a   Rao, S Srinivasa ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; LOWER BOUNDS; PREPROCESS; QUERY TIME; RANGE MINIMUM QUERIES; SPACE EFFICIENT; TWO-DIMENSION;

DATA STRUCTURES; TWO DIMENSIONAL;

ALGORITHMS;

EID: 78349250972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15781-3_15     Document Type: Conference Paper

References (18)

1. Aho, A., Hopcroft, J., Ullman, J.: On finding lowest common ancestors in trees. In: Proc. 5th Annual ACM Symposium on Theory of Computing, pp. 253-265. ACM Press, New York (1973)
2. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 258-264. ACM, New York (2002)
3. Amir, A., Fischer, J., Lewenstein, M.: Two-dimensional range minimum queries. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 286-294. Springer, Heidelberg (2007)
4. Atallah, M.J., Yuan, H.: Data structures for range minimum queries in multi-dimensional arrays. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 150-160. SIAM, Philadelphia (2010)
5. Bender, M., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
6. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57(2), 75-94 (2005)
7. Bentley, J.L.: Decomposable searching problems. Information Processing Letters 8(5), 244-251 (1979)
8. Berkman, O., Galil, Z., Schieber, B., Vishkin, U.: Highly parallelizable problems. In: Proc. 21st Ann. ACM Symposium on Theory of Computing, pp. 309-319. ACM, New York (1989)
9. Chazelle, B., Rosenberg, B.: Computing partial sums in multidimensional arrays. In: Proc. 5th Annual Symposium on Computational Geometry, pp. 131-139. ACM, New York (1989)
10. Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 341-353. Springer, Heidelberg (2009)
11. Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158-169. Springer, Heidelberg (2010)
12. Fischer, J., Heun, V.: A new succinct representation of rmq-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007)
13. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 135-143. ACM, New York (1984)
14. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13(2), 338-355 (1984)
15. Miltersen, P.B.: Cell probe complexity - a survey. In: Advances in Data Structures Workshop (FSTTCS) (1999)
16. Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms 5(1), 12-22 (2007)
17. Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing 17(6), 1253-1262 (1988)
18. Vuillemin, J.: A unifying look at data structures. Communications of the ACM 23(4), 229-239 (1980)