default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaviel Rojas-Ledesma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Diego Arroyuelo
, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma, Adrián Soto:
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space. ACM Trans. Database Syst. 49(2): 5:1-5:45 (2024)- [j6]Diego Arroyuelo, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Javiel Rojas-Ledesma:
Optimizing RPQs over a compact graph representation. VLDB J. 33(2): 349-374 (2024) - 2022
- [j5]Diego Arroyuelo, Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma:
Optimal Joins Using Compressed Quadtrees. ACM Trans. Database Syst. 47(2): 8:1-8:53 (2022) - [c5]Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro, Javiel Rojas-Ledesma:
Time- and Space-Efficient Regular Path Queries. ICDE 2022: 3091-3105 - [d1]Diego Arroyuelo, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Javiel Rojas-Ledesma:
Datasets of Time- and Space-Efficient Regular Path Queries. Zenodo, 2022
- 2021
- [j4]Gonzalo Navarro, Javiel Rojas-Ledesma:
Predecessor Search. ACM Comput. Surv. 53(5): 105:1-105:35 (2021) - [j3]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing the depth distribution of a set of boxes. Theor. Comput. Sci. 883: 69-82 (2021) - [c4]Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma, Adrián Soto:
Worst-Case Optimal Graph Joins in Almost No Space. SIGMOD Conference 2021: 102-114 - [i6]Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro, Javiel Rojas-Ledesma:
Time- and Space-Efficient Regular Path Queries on Graphs. CoRR abs/2111.04556 (2021) - 2020
- [j2]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing coverage kernels under restricted settings. Theor. Comput. Sci. 815: 270-288 (2020) - [c3]Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma:
Optimal Joins Using Compact Data Structures. ICDT 2020: 21:1-21:21
2010 – 2019
- 2019
- [i5]Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma:
Optimal Joins using Compact Data Structures. CoRR abs/1908.01812 (2019) - 2018
- [c2]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. COCOON 2018: 180-191 - [i4]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. CoRR abs/1805.04223 (2018) - 2017
- [j1]Luis Evaristo Caraballo, Carlos Ochoa, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Matching colored points with rectangles. J. Comb. Optim. 33(2): 403-421 (2017) - [c1]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Depth Distribution in High Dimensions. COCOON 2017: 38-49 - [i3]Jérémy Barbay, Javiel Rojas:
Multivariate Analysis for Computing Maxima in High Dimensions. CoRR abs/1701.03693 (2017) - [i2]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Depth Distribution in High Dimensions. CoRR abs/1705.10022 (2017) - 2015
- [i1]Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Adaptive Computation of the Klee's Measure in High Dimensions. CoRR abs/1505.02855 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
