Optimal succinctness for range minimum queries

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

Volumn 6034 LNCS, Issue , 2010, Pages 158-169

  Fischer, Johannes ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CONSTANT TIME; LINEAR TIME; PRE-PROCESSING STEP; PREPROCESS; RANGE MINIMUM QUERIES; STATIC ARRAYS;

INFORMATION SCIENCE; OPTIMIZATION;

TREES (MATHEMATICS);

EID: 77953512344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12200-2_16     Document Type: Conference Paper

References (23)

1. Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41(4), 589-607 (2007)
2. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51), 5354-5364 (2009)
3. Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1), 12-22 (2007)
4. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved algorithms for the range next value problem and applications. In: Proc. STACS, IBFI Schloss Dagstuhl, pp. 205-216 (2008)
5. Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221-242 (1993)
6. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75-94 (2005) (Pubitemid 41501355)
7. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. SPAA, pp. 258-264 (2002)
8. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762-776 (2001)
9. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
10. Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3), 231-246 (2006)
11. Jansson, J., Sadakane, K., Sung, W.K.: Ultra-succinct representation of ordered trees. In: Proc. SODA, pp. 575-584. ACM/SIAM (2007)
12. Sadakane, K., Navarro, G.: Fully-functional succinct trees. Accepted for SODA 2010. See also CoRR, abs/0905.0768v1 (2009)
13. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2), Article No. 20 (2007)
14. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2), 294-313 (2003)
15. 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)
16. Fischer, J., Heun, V., Stühler, H.M.: Practical entropy bounded schemes for O(1)-range minimum queries. In: Proc. DCC, pp. 272-281. IEEE Press, Los Alamitos (2008)
17. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
18. Vuillemin, J.: A unifying look at data structures. Comm. ACM23(4), 229-239 (1980)
19. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS, pp. 549-554. IEEE Computer Society Press, Los Alamitos (1989)
20. Bialynicka-Birula, I., Grossi, R.: Amortized rigidness in dynamic Cartesian Trees. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 80-91. Springer, Heidelberg (2006)
21. Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387(3), 348-359 (2007)
22. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. SODA, pp. 657-666. ACM/SIAM (2002)
23. Fischer, J.: Optimal succinctness for range minimum queries. CoRR, abs/0812.2775 (2008)