| Worst-case optimal graph joins in almost no space D Arroyuelo, A Hogan, G Navarro, JL Reutter, J Rojas-Ledesma, A Soto Proceedings of the 2021 International Conference on Management of Data, 102-114, 2021 | 43 | 2021 |
| Optimal joins using compact data structures G Navarro, JL Reutter, J Rojas-Ledesma arXiv preprint arXiv:1908.01812, 2019 | 28 | 2019 |
| Time-and space-efficient regular path queries D Arroyuelo, A Hogan, G Navarro, J Rojas-Ledesma 2022 IEEE 38th International Conference on Data Engineering (ICDE), 3091-3105, 2022 | 21 | 2022 |
| Predecessor search G Navarro, J Rojas-Ledesma ACM Computing Surveys (CSUR) 53 (5), 1-35, 2020 | 20 | 2020 |
| Matching colored points with rectangles LE Caraballo, C Ochoa, P Pérez-Lantero, J Rojas-Ledesma Journal of Combinatorial Optimization 33 (2), 403-421, 2017 | 15 | 2017 |
| Optimal joins using compressed quadtrees D Arroyuelo, G Navarro, JL Reutter, J Rojas-Ledesma ACM Transactions on Database Systems (TODS) 47 (2), 1-53, 2022 | 12 | 2022 |
| Optimizing RPQs over a compact graph representation D Arroyuelo, A Gómez-Brandón, A Hogan, G Navarro, J Rojas-Ledesma The VLDB Journal 33 (2), 349-374, 2024 | 8 | 2024 |
| Depth distribution in high dimensions J Barbay, P Pérez-Lantero, J Rojas-Ledesma International Computing and Combinatorics Conference, 38-49, 2017 | 4 | 2017 |
| The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space D Arroyuelo, A Gómez-Brandón, A Hogan, G Navarro, J Reutter, ... ACM Transactions on Database Systems 49 (2), 1-45, 2024 | 3 | 2024 |
| Computing coverage kernels under restricted settings J Barbay, P Pérez-Lantero, J Rojas-Ledesma Theoretical Computer Science 815, 270-288, 2020 | 2 | 2020 |
| Adaptive Computation of the Klee's Measure in High Dimensions J Barbay, P Pérez-Lantero, J Rojas-Ledesma arXiv preprint arXiv:1505.02855, 2015 | 1 | 2015 |
| The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space DG Arroyuelo Billiardi, A Gómez-Brandón, A Hogan, G Navarro, ... | | 2024 |
| Computing the depth distribution of a set of boxes J Barbay, P Perez-Lantero, J Rojas-Ledesma Theoretical Computer Science 883, 69-82, 2021 | | 2021 |
| Matching and covering with boxes J Rojas Ledesma Universidad de Chile, 2018 | | 2018 |
Pablo Pérez-LanteroProfessor, Universidad de Santiago de Chile (USACH)Dirección de correo verificada de usach.cl
