Guillermo de Bernardo

Orcid: 0000-0002-6020-7092

According to our database1, Guillermo de Bernardo authored at least 30 papers between 2009 and 2024.

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

2024
Reproducible experiments for generating pre-processing pipelines for AutoETL.
Inf. Syst., February, 2024

Compressed and queryable self-indexes for RDF archives.
Knowl. Inf. Syst., January, 2024

2023
Space/time-efficient RDF stores based on circular suffix sorting.
J. Supercomput., March, 2023

Faster compressed quadtrees.
J. Comput. Syst. Sci., 2023

2022
A practical succinct dynamic graph representation.
Inf. Comput., 2022

A New Tool Based on GIS Technology for Massive Public Transport Data.
Proceedings of the Advances in Model and Data Engineering in the Digitalization Era, 2022

Compact Data Structures for Efficient Processing of Distance-Based Join Queries.
Proceedings of the Model and Data Engineering: 11th International Conference, 2022

2021
Space-efficient representations of raster time series.
Inf. Sci., 2021

2020
Extending general compact querieable representations to GIS applications.
Inf. Sci., 2020

On Dynamic Succinct Graph Representations.
Proceedings of the Data Compression Conference, 2020

Revisiting Compact RDF Stores Based on k2-Trees.
Proceedings of the Data Compression Conference, 2020

2019
Faster Dynamic Compressed d-ary Relations.
Proceedings of the String Processing and Information Retrieval, 2019

Improved Compressed String Dictionaries.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Towards a Compact Representation of Temporal Rasters.
Proceedings of the String Processing and Information Retrieval, 2018

Compact Representations of Event Sequences.
Proceedings of the 2018 Data Compression Conference, 2018

About BIRDS project (Bioinformatics and Information Retrieval Data Structures Analysis and Design).
Proceedings of the 5th Spanish Conference on Information Retrieval, 2018

2017
A succinct data structure for self-indexing ternary relations.
J. Discrete Algorithms, 2017

Compressed representation of dynamic binary relations with applications.
Inf. Syst., 2017

Efficiently Querying Vector and Raster Data.
Comput. J., 2017

2016
Aggregated 2D range queries on clustered points.
Inf. Syst., 2016

A New method to Index and Store Spatio-Temporal Data.
Proceedings of the 20th Pacific Asia Conference on Information Systems, 2016

2015
Efficient Set Operations over k2-Trees.
Proceedings of the 2015 Data Compression Conference, 2015

2014
K 2-Treaps: Range Top-k Queries in Compact Space.
Proceedings of the String Processing and Information Retrieval, 2014

Interleaved K2-Tree: Indexing and Navigating Ternary Relations.
Proceedings of the Data Compression Conference, 2014

2013
Compact Querieable Representations of Raster Data.
Proceedings of the String Processing and Information Retrieval, 2013

Compact Data Structures for Temporal Graphs.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Compressed Dynamic Binary Relations.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

2011
An Integrated System for School Timetabling.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1, 2011

eAdmin: an e-government system for the Galician region.
Proceedings of the 12th Annual International Conference on Digital Government Research, 2011

2009
SCRABBLE.GZ: A Web-Based Collaborative Game to Promote the Galician Language.
Proceedings of the Second International Conference on Advances in Computer-Human Interaction, 2009


  Loading...