Javiel Rojas-Ledesma

Orcid: 0000-0003-3208-1880

According to our database1, Javiel Rojas-Ledesma authored at least 14 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimizing RPQs over a compact graph representation.
VLDB J., 2024

2022
Datasets of Time- and Space-Efficient Regular Path Queries.
Dataset, October, 2022

Optimal Joins Using Compressed Quadtrees.
ACM Trans. Database Syst., 2022

Time- and Space-Efficient Regular Path Queries.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Computing the depth distribution of a set of boxes.
Theor. Comput. Sci., 2021

Predecessor Search.
ACM Comput. Surv., 2021

Time- and Space-Efficient Regular Path Queries on Graphs.
CoRR, 2021

Worst-Case Optimal Graph Joins in Almost No Space.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2020
Computing coverage kernels under restricted settings.
Theor. Comput. Sci., 2020

Optimal Joins Using Compact Data Structures.
Proceedings of the 23rd International Conference on Database Theory, 2020

2017
Matching colored points with rectangles.
J. Comb. Optim., 2017

Multivariate Analysis for Computing Maxima in High Dimensions.
CoRR, 2017

Depth Distribution in High Dimensions.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2015
Adaptive Computation of the Klee's Measure in High Dimensions.
CoRR, 2015


  Loading...