Diego Arroyuelo
- Arroyuelo, D., Cánovas, R., Navarro, G. and Sadakane, K. Succinct trees in practice. In Proceedings of the Workshop on Algorithm Engineering and Experiments. SIAM, 2010, 84--97.Google Scholar
Cross Ref
- Arroyuelo, D., Davoodi, P. and Rao Satti, S. Succinct dynamic cardinal trees. Algorithmica 74, 2 (2016), 742--777.Google ScholarDigital Library
- Arroyuelo, D. and Navarro, G. Space-efficient construction of Lempel-Ziv compressed text indexes. Information and Computation 209, 7 (2011), 1070--1102.Google ScholarDigital Library
- Brisaboa, N.R., Ladra, S. and Navarro, G. Compact representation of web graphs with extended functionality. Information Systems 39 (2014), 152--174.Google ScholarDigital Library
- Cunial, F. Mäkinen, V., Belazzougui, D. and Tomescu, A.I. Genome-Scale Algorithm Design---Biological Sequence Analysis in the Era of High-throughput Sequencing. Cambridge University Press, 2015.Google Scholar
- Ferres, L., Fuentes-Sepülveda, J., Gagie, T., He, M. and Navarro, G. Fast and compact planar embeddings. Computational Geometry 89 (2020), 101630.Google ScholarCross Ref
- Fuentes-Sepúlveda, J., Navarro, G. and Seco, D. Implementing the topological model succinctly. String Processing and Information Retrieval. Springer Intern. Publishing, 2019, 499--512.Google Scholar
- Gagie, T., Navarro, G. and Prezza, N. Fully functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67, 1 (Jan. 2020).Google ScholarDigital Library
- Jacobson, G. Space-efficient static trees and graphs. In Annual Symp. Foundations of Computer Science. IEEE Computer Society, 1989, 549--554.Google ScholarDigital Library
- Navarro, G. Compact Data Structures---A Practical Approach. Cambridge University Press, 2016.Google ScholarCross Ref
- Navarro, G. and Sadakane, K. Fully functional static and dynamic succinct trees. ACM Transactions on Algorithms 10, 3 (2014), 16:1--16:39.Google ScholarDigital Library
- Navarro, G., Reutter, J.L. and Rojas-Ledesma, J. Optimal joins using compact data structures. In Proceedings of the Intern. Conf. Database Theory Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020, 21:1--21:21.Google Scholar
Index Terms
- Three success stories about compact data structures
Recommendations
Minimal structures for stories
SRMC '04: Proceedings of the 1st ACM workshop on Story representation, mechanism and contextOur research on Interactive Drama aims at conciliating interaction and story at the deepest level, the level of action. From a given story representation formalism, a set of elementary narrative structures is derived in order to capture the minimal ...
Stories Incarnate: Designing embodied, interactive storytelling experiences for live audiences
C&C '21: Proceedings of the 13th Conference on Creativity and CognitionProviding embodied, interactive experiences for live audiences in traditional performance venues remains an ongoing challenge in the live entertainment industry. This paper presents a proof-of-concept performance piece which engages a seated audience in ...
Interactive stories and the audience: Why empathy is important
SPECIAL ISSUE: TV and Video Entertainment EnvironmentsInteractive narratives have long been advocated as having the potential to create more immersive and transformative experiences for audiences by adding the pleasure of agency. In practice, however, finding the balance between sufficient interactivity ...
Comments