Author:
Davoodi Pooya,Raman Rajeev,Satti Srinivasa Rao
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics
Reference26 articles.
1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1), 53–86 (2004)
2. Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 84–97. SIAM, New Delhi (2010)
3. 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)
4. Chen, G., Puglisi, S.J., Smyth, W.F.: Lempel-Ziv factorization using less time and space. Math. Comput. Sci. 1, 605–623 (2008)
5. Davoodi, P., Navarro, G., Raman, R., Satti, S.R.: Encoding range minima and range top-2 queries. Philos. Trans. R. Soc. A 372, 20130131 (2014)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Facial augmented reality based on hierarchical optimization of similarity aspect graph;Computer Methods and Programs in Biomedicine;2024-05
2. Succinct Permutation Graphs;Algorithmica;2022-09-24
3. Practical Implementation of Encoding Range Top-2 Queries;The Computer Journal;2022-09-10
4. Tree-Encoded Bitmaps;Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data;2020-06-11
5. Lower bound for succinct range minimum query;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06