Publicaciones

• Adaptive Dynamic Bitvectors String Processing And Information Retrieval, Spire 2024 , vol 14899 , 2025 , pag 204-217
• Compressed Graph Representations for Evaluating Regular Path Queries String Processing And Information Retrieval, Spire 2024 , vol 14899 , 2025 , pag 218-232
• Computing MEMs and Relatives on Repetitive Text Collections Acm Transactions On Algorithms , vol 21 , 2025
• Evaluating regular path queries on compressed adjacency matrices Vldb Journal , vol 34 , 2025
• Generalized straight-line programs Acta Informatica , vol 62 , 2025
• Clustering-based compression for raster time series Computer Journal , 2024
• Dynamic compact data structure for temporal reachability with unsorted contact insertions Computer Journal , vol 67 , 2024 , pag 2984-2994
• Faster Maximal Exact Matches with Lazy LCP Evaluation 2024 Data Compression Conference, DCC , 2024 , pag 123-132
• Iterated Straight-Line Programs Latin 2024: Theoretical Informatics, Pt I , vol 14578 , 2024 , pag 66-80
• MillenniumDB: A Multi-modal, Multi-model Graph Database Companion Of The 2024 International Conference On Management Of Data, Sigmod-Companion 2024 , 2024 , pag 496-499
• Near-Optimal Search Time in δ-Optimal Space, and Vice Versa Algorithmica , vol 86 , 2024 , pag 1031-1056
• Optimizing RPQs over a compact graph representation Vldb Journal , vol 33 , 2024 , pag 349-374
• Space & Time Efficient Leapfrog Triejoin Proceedings Of The 7TH Acm Sigmod Joint International Workshop On Graph Data Management Experiences & Systems, Grades 2024 And Network Data Analytics, Nda 2024, Grades-Nda 2024 , 2024
• Space-Efficient Conversions from SLPs Latin 2024: Theoretical Informatics, Pt I , vol 14578 , 2024 , pag 146-161
• Space-efficient data structures for the inference of subsumption and disjointness relations Software-Practice & Experience , 2024
• Stronger compact representations of object trajectories Geo-Spatial Information Science , 2024
• Tackling Challenges in Implementing Large-Scale Graph Databases Communications Of The Acm , vol 67 , 2024 , pag 40-44
• The Ring: Worst-Case Optimal Joins in Graph Databases using (Almost) No Extra Space Acm Transactions On Database Systems , 2024
• Two-Dimensional Block Trees Computer Journal , vol 67 , 2024 , pag 391-406
• Wheeler Maps Latin 2024: Theoretical Informatics, Pt I , vol 14578 , 2024 , pag 178-192
• Faster compressed quadtrees Journal Of Computer And System Sciences , vol 131 , 2023 , pag 86-104
• MillenniumDB: An Open-Source Graph Database System Data Intelligence , 2023
• Navigating planar topologies in near-optimal space and time Computational Geometry-Theory And Applications , vol 109 , 2023
• A practical succinct dynamic graph representation Information And Computation , vol 285 , 2022
• Efficient and compact representations of some non-canonical prefix-freecodes Theoretical Computer Science , vol 907 , 2022 , pag 11-25
• Faster repetition-aware compressed suffix trees based on Block Trees Information And Computation , vol 285 , 2022
• Optimal Joins Using Compressed Quadtrees Acm Transactions On Database Systems , vol 47 , 2022
• The Compression Power of the BWT Communications Of The Acm , vol 65 , 2022 , pag 90-90
• Total mutational load and clinical features as predictors of the metastatic status in lung adenocarcinoma and squamous cell carcinoma patients Journal Of Translational Medicine , vol 20 , 2022
• An index for moving objects with constant-time access to theircompressed trajectories International Journal Of Geographical Information Science , vol 35 , 2021 , pag 1392-1424
• Block trees Journal Of Computer And System Sciences , vol 117 , 2021 , pag 1-22
• Compact structure for sparse undirected graphs based on a clique graphpartition Information Sciences , vol 544 , 2021 , pag 485-499
• Grammar-compressed indexes with logarithmic search time Journal Of Computer And System Sciences , vol 118 , 2021 , pag 53-74
• Indexing Highly Repetitive String Collections, Part I: RepetitivenessMeasures Acm Computing Surveys , vol 54 , 2021
• Indexing Highly Repetitive String Collections, Part II: CompressedIndexes Acm Computing Surveys , vol 54 , 2021
• On the Approximation Ratio of Ordered Parsings Ieee Transactions On Information Theory , vol 67 , 2021 , pag 1008-1026
• Optimal-Time Dictionary-Compressed Indexes Acm Transactions On Algorithms , vol 17 , 2021
• Range Majorities and Minorities in Arrays Algorithmica , vol 83 , 2021 , pag 1707-1733
• Compressed Dynamic Range Majority and Minority Data Structures Algorithmica , vol 82 , 2020 , pag 2063-2086
• Extending general compact querieable representations to GIS applications Information Sciences , vol 506 , 2020 , pag 196-216
• Fast Compressed Self-indexes with Deterministic Linear-Time Construction Algorithmica , vol 82 , 2020 , pag 316-337
• Fast and compact planar embeddings Computational Geometry-Theory And Applications , vol 89 , 2020
• Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space Journal Of The Acm (Jacm) , vol 67 , 2020
• Latin America Regional Special Section Communications Of The Acm , vol 63 , 2020 , pag 42-44
• Lempel-Ziv-Like Parsing in Small Space Algorithmica , vol 82 , 2020 , pag 3195-3215
• Parallel computation of the Burrows Wheeler Transform in compact space Theoretical Computer Science , vol 812 , 2020 , pag 123-136
• Predecessor Search Acm Computing Surveys , vol 53 , 2020
• Ranked document selection Theoretical Computer Science , vol 812 , 2020 , pag 149-159
• Tree path majority data structures Theoretical Computer Science , vol 833 , 2020 , pag 107-119
• Cell cycle and protein complex dynamics in discovering signaling pathways Journal Of Bioinformatics And Computational Biology , vol 17 , 2019
• Compressed filesystem for managing large genome collections Bioinformatics , vol 35 , 2019 , pag 4120-4128
• Document listing on repetitive collections with guaranteed performance Theoretical Computer Science , vol 772 , 2019 , pag 58-72
• GraCT: A Grammar-based Compressed Index for Trajectory Data Information Sciences , vol 483 , 2019 , pag 106-135
• Lempel-Ziv compressed structures for document retrieval Information And Computation , vol 265 , 2019 , pag 1-25
• On the reproducibility of experiments of indexing repetitive documentcollections Information Systems , vol 83 , 2019 , pag 181-194
• Path queries on functions Theoretical Computer Science , vol 770 , 2019 , pag 34-50
• RePair and All Irreducible Grammars Are Upper Bounded by High-OrderEmpirical Entropy Ieee Transactions On Information Theory , vol 65 , 2019 , pag 3160-3164
• Universal compressed text indexing Theoretical Computer Science , vol 762 , 2019 , pag 41-50
• Better space bounds for parameterized range majority and minority  ( Conference Paper ) Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics) ,
• Better space bounds for parameterized range majority and minority  (Conference Paper) Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics) ,
• Compact binary relation representations with rich functionality Information And Computation ,
• Compact representation of Web graphs with extended functionality Information Systems ,
• Compressed representations for web and social graphs  (  Article in press  ) Knowledge And Information Systems ,
• Compressing Huffman models on large alphabets  ( Conference Paper ) Data Compression Conference Proceedings ,
• Compressing Huffman models on large alphabets  (Conference Paper) Data Compression Conference Proceedings ,
• Document listing on repetitive collections  (Conference Paper) Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics) ,
• Editorial  (  Article in press  ) Information Systems ,
• Encodings for range selection and top-k queries  (Conference Paper) Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics) ,
• Entropy-bounded representation of point grids Computational Geometry: Theory And Applications ,
• Faster and smaller inverted indices with treaps  (Conference Paper) Sigir 2013 - Proceedings Of The 36TH International Acm Sigir Conference On Research And Development In Information Retrieval ,
• Faster compact top-k document retrieval  ( Conference Paper ) Data Compression Conference Proceedings ,
• Faster compact top-k document retrieval  (Conference Paper) Data Compression Conference Proceedings ,
• On compressing permutations and adaptive sorting  (  Article in press  ) Theoretical Computer Science ,
• Optimal dynamic sequence representations  ( Conference Paper ) Proceedings Of The Annual Acm-Siam Symposium On Discrete Algorithms ,
• Optimal dynamic sequence representations  (Conference Paper) Proceedings Of The Annual Acm-Siam Symposium On Discrete Algorithms ,
• Space-efficient representations of rectangle datasets supporting orthogonal range querying Information Systems ,
• Space/time-efficient RDF stores based on circular suffix sorting Journal Of Supercomputing ,
• Wavelet trees for all  (  Article in press  ) Journal Of Discrete Algorithms ,