Dynamic text and static pattern matching, ACM Trans. Algorithms, vol.3, 2007. ,
DOI : 10.1007/978-3-540-45078-8_30
Dynamic ordered sets with exponential search trees, Journal of the ACM, vol.54, issue.3, p.13, 2007. ,
DOI : 10.1145/1236457.1236460
Two Simplified Algorithms for Maintaining Order in a List, Proceedings of the 10th Annual European Symposium on Algorithms, ESA '02, pp.152-164, 2002. ,
DOI : 10.1007/3-540-45749-6_17
The LCA Problem Revisited, Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pp.88-94, 2000. ,
DOI : 10.1007/10719839_9
The Level Ancestor Problem simplified, Theoretical Computer Science, vol.321, issue.1, pp.5-12, 2004. ,
DOI : 10.1016/j.tcs.2003.05.002
Finding level-ancestors in trees, Journal of Computer and System Sciences, vol.48, issue.2, pp.214-230, 1994. ,
DOI : 10.1016/S0022-0000(05)80002-9
New upper bounds for generalized intersection searching problems, Automata, Languages and Programming , 22nd International ColloquiumICALP) Proceedings, pp.464-474, 1995. ,
DOI : 10.1007/3-540-60084-1_97
Path Minima Queries in Dynamic Weighted Trees, Proceedings of the 12th International Symposium on Algorithms and Data Structures, pp.290-301, 2011. ,
DOI : 10.1007/978-3-642-22300-6_25
Two algorithms for maintaining order in a list, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.365-372, 1987. ,
DOI : 10.1145/28395.28434
Perfect hashing for strings: Formalization and algorithms, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM '96, pp.130-140, 1996. ,
DOI : 10.1007/3-540-61258-0_11
Trans-dichotomous algorithms for minimum spanning trees and shortest paths, Journal of Computer and System Sciences, vol.48, issue.3, pp.533-551, 1994. ,
DOI : 10.1016/S0022-0000(05)80064-9
Colored range queries and document retrieval, Proceedings of the 17th International Conference on String Processing and Information Retrieval, SPIRE'10, pp.67-81, 2010. ,
DOI : 10.1016/j.tcs.2012.08.004
Rank/select operations on large alphabets, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.368-373, 2006. ,
DOI : 10.1145/1109557.1109599
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract), Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.397-406, 2000. ,
DOI : 10.1145/335305.335351
Efficient algorithms for document retrieval problems, Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp.657-666, 2002. ,
Compressed full-text indexes, ACM Computing Surveys, vol.39, issue.1, 2007. ,
DOI : 10.1145/1216370.1216372
Compressed Suffix Trees with Full Functionality, Theory of Computing Systems, vol.41, issue.4, pp.589-607, 2007. ,
DOI : 10.1007/s00224-006-1198-x
Succinct data structures for flexible text retrieval systems, Journal of Discrete Algorithms, vol.5, issue.1, pp.12-22, 2007. ,
DOI : 10.1016/j.jda.2006.03.011