José Fuentes-Sepúlveda

Orcid: 0000-0002-3962-6495

Affiliations:
  • Universidad de Concepción, Chile


According to our database1, José Fuentes-Sepúlveda authored at least 23 papers between 2011 and 2026.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Estimating the compressibility of raster data.
Inf. Syst., 2026

2025
Space-efficient data structures for the inference of subsumption and disjointness relations.
Softw. Pract. Exp., 2025

Clustering-based compression for raster time series.
Comput. J., 2025

Worst-Case-Optimal Joins on Graphs with Topological Relations.
Proceedings of the ACM on Web Conference 2025, 2025

2023
Compact representations of spatial hierarchical structures with support for topological queries.
Inf. Comput., June, 2023

When Edge Computing Meets Compact Data Structures.
CoRR, 2023

Navigating planar topologies in near-optimal space and time.
Comput. Geom., 2023

2022
Speeding up compact planar graphs by using shallower trees.
Proceedings of the Data Compression Conference, 2022

2021
Succinct Encoding of Binary Strings Representing Triangulations.
Algorithmica, 2021

Compact Representation of Spatial Hierarchies and Topological Relationships.
Proceedings of the 31st Data Compression Conference, 2021

2020
Parallel computation of the Burrows Wheeler Transform in compact space.
Theor. Comput. Sci., 2020

Three success stories about compact data structures.
Commun. ACM, 2020

2019
Energy Consumption in Compact Integer Vectors: A Study Case.
IEEE Access, 2019

Implementing the Topological Model Succinctly.
Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Computation of the Burrows-Wheeler Transform.
Proceedings of the Data Compression Conference, 2019

2018
Run Compressed Rank/Select for Large Alphabets.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Parallel construction of wavelet trees on multicore architectures.
Knowl. Inf. Syst., 2017

Parallel Construction of Compact Planar Embeddings.
CoRR, 2017

Fast and Compact Planar Embeddings.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM.
CoRR, 2016

2015
Parallel Construction of Succinct Trees.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014
Efficient Wavelet Tree Construction and Querying for Multicore Architectures.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2011
Improving accessibility to mathematical formulas: the Wikipedia math accessor.
Proceedings of the International Cross-Disciplinary Conference on Web Accessibility, 2011


  Loading...