20 citations · 32 across the 6 of their papers we have counts for
8 papers
When Edge Computing Meets Compact Data Structures
Zheng Li, Diego Seco, José Fuentes-Sepúlveda
Edge computing enables data processing and storage closer to where the data are created. Given the largely distributed compute environment and the significantly dispersed data dist…
Energy consumption in compact integer vectors: A study case
José Fuentes-Sepúlveda, Susana Ladra
In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy con…
Navigating Planar Topologies in Near-Optimal Space and Time
José Fuentes-Sepúlveda, Gonzalo Navarro, Diego Seco
We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a suc…
Run Compressed Rank/Select for Large Alphabets
José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov +1
Given a string of length that is composed of runs of letters from the alphabet such that , we describe a data structure that, provided…
Parallel Construction of Compact Planar Embeddings
Leo Ferres, José Fuentes-Sepúlveda, Travis Gagie +2
The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a…
Parallel Construction of Wavelet Trees on Multicore Architectures
José Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres +1
The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic infor…
Fast and Compact Planar Embeddings
Leo Ferres, José Fuentes, Travis Gagie +2
There are many representations of planar graphs, but few are as elegant as Turán's (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multi-ed…
Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM
Erick Elejalde, Jose Fuentes-Sepúlveda, Leo Ferres
Succinct trees, such as wavelet trees and those based on, for instance, range Min-Max trees (RMMTs), are a family of practical data structures that store information close to their…