default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilberto Gutiérrez 0001
Person information
- affiliation: University of the Bío Bío, Department of Computer Science and Information Technology, Chillán, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Gilberto Gutiérrez
, Rodrigo Torres-Avilés, Mónica Caniupán:
cKd-tree: A Compact Kd-tree. IEEE Access 12: 28666-28676 (2024)- 2021
- [j12]Martita Muñoz Candia, Gilberto Gutiérrez Retamal, Rodrigo Torres-Avilés:
An Efficient Algorithm to Count the Relations in a Range of Binary Relations Represented by a k²-Tree. IEEE Access 9: 20808-20818 (2021) - 2020
- [j11]Carlos Quijada-Fuentes, Miguel R. Penabad, Susana Ladra, Gilberto Gutiérrez Retamal:
Compressed Data Structures for Binary Relations in Practice. IEEE Access 8: 25949-25963 (2020) - [j10]Carlos E. Sanjuan-Contreras, Gilberto Gutiérrez Retamal, Miguel A. Martínez-Prieto, Diego Seco:
cBiK: A Space-Efficient Data Structure for Spatial Keyword Queries. IEEE Access 8: 98827-98846 (2020) - [j9]Juan Felipe Castro, Miguel Romero, Gilberto Gutiérrez, Mónica Caniupán, Carlos Quijada-Fuentes:
Efficient computation of the convex hull on sets of points stored in a k-tree compact data structure. Knowl. Inf. Syst. 62(10): 4091-4111 (2020) - [i4]Carlos Quijada-Fuentes, Miguel R. Penabad, Susana Ladra, Gilberto Gutiérrez:
Compressed Data Structures for Binary Relations in Practice. CoRR abs/2002.09041 (2020)
2010 – 2019
- 2019
- [j8]Carlos Quijada-Fuentes, Miguel R. Penabad, Susana Ladra, Gilberto Gutiérrez:
Set operations over compressed binary relations. Inf. Syst. 80: 76-90 (2019) - [c11]Nataly Cruces, Diego Seco, Gilberto Gutiérrez:
A Compact Representation of Raster Time Series. DCC 2019: 103-111 - [i3]Nataly Cruces, Diego Seco, Gilberto Gutiérrez:
A Compact Representation of Raster Time Series. CoRR abs/1901.01944 (2019) - [i2]Fernando Silva-Coira, José R. Paramá, Susana Ladra, Juan-Ramón López, Gilberto Gutiérrez:
Efficient processing of raster and vector data. CoRR abs/1912.11866 (2019) - 2018
- [j7]Claudio Torres, Pablo Pérez-Lantero, Gilberto Gutiérrez:
Linear separability in spatial databases. Knowl. Inf. Syst. 54(2): 287-314 (2018) - [j6]Gilberto Gutiérrez, Juan-Ramón López, José R. Paramá, Miguel R. Penabad:
The largest empty circle with location constraints in spatial databases. Knowl. Inf. Syst. 55(1): 141-169 (2018) - [c10]Gilberto Gutiérrez, Miguel Romero, Fernando Domínguez:
Algorithm to Calculate the Hausdorff Distance on Sets of Points Represented by k2-Tree. CLEI 2018: 482-489 - [c9]Gilberto Gutiérrez, Susana Ladra, Juan-Ramón López, José R. Paramá, Fernando Silva-Coira:
Efficient Processing of top-K Vector-Raster Queries Over Compressed Data. DCC 2018: 410 - [c8]Carlos San Juan C., Gilberto Gutiérrez R., Miguel A. Martínez-Prieto:
A Compact Memory-based Index for Spatial Keyword Query Resolution. SCCC 2018: 1-8 - 2017
- [j5]Nieves R. Brisaboa, Guillermo de Bernardo, Gilberto Gutiérrez, Miguel R. Luaces, José R. Paramá:
Efficiently Querying Vector and Raster Data. Comput. J. 60(9): 1395-1413 (2017) - [j4]Katherine Zapata-Quiñones, Cristian Duran-Faundez, Gilberto Gutiérrez, Vincent Lecuire, Christopher Arredondo-Flores, Hugo Jara-Lipán:
A Genetic Algorithm for the Generation of Packetization Masks for Robust Image Communication. Sensors 17(5): 981 (2017) - [c7]Alejandro Pinto, Diego Seco, Gilberto Gutiérrez:
Improved Queryable Representations of Rasters. DCC 2017: 320-329 - [c6]Cristian Vallejos, Mónica Caniupán, Gilberto Gutiérrez:
K2-treaps to represent and query data warehouses into main memory. SCCC 2017: 1-12 - 2016
- [i1]Gilberto Gutiérrez, Pablo Pérez-Lantero, Claudio Torres:
Linear Separability in Spatial Databases. CoRR abs/1602.04399 (2016) - 2015
- [j3]Joel Fuentes, Pablo Sáez, Gilberto Gutiérrez, Isaac D. Scherson:
A Method to Find Functional Dependencies Through Refutations and Duality of Hypergraphs. Comput. J. 58(5): 1186-1198 (2015) - [c5]Nieves R. Brisaboa, Guillermo de Bernardo, Gilberto Gutiérrez, Susana Ladra, Miguel R. Penabad, Brunny A. Troncoso:
Efficient Set Operations over k2-Trees. DCC 2015: 373-382 - 2014
- [j2]Gilberto Gutiérrez, José R. Paramá, Nieves R. Brisaboa, Antonio Corral:
The largest empty rectangle containing only a query object in Spatial Databases. GeoInformatica 18(2): 193-228 (2014) - 2013
- [j1]Gilberto Gutiérrez, Pablo Sáez:
The k closest pairs in spatial databases - When only one set is indexed. GeoInformatica 17(4): 543-565 (2013) - 2012
- [c4]Gilberto Gutiérrez, José R. Paramá:
Finding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases. SSDBM 2012: 316-333 - 2010
- [c3]Miguel Pincheira, Gilberto Gutiérrez, Luis Gajardo:
Closest Pair Query on Spatial Data Sets without Index. SCCC 2010: 178-182
2000 – 2009
- 2008
- [c2]Claudio Gutiérrez-Soto, Gilberto A. Gutiérrez, Pedro Rodríguez, Pedro Campos:
Paralelización de Consultas del tipo time-interval en Base de Espacio-Temporales. JIISIC 2008: 41-48 - 2005
- [c1]Gilberto A. Gutiérrez, Gonzalo Navarro, M. Andrea Rodríguez, Alejandro F. González, José Orellana:
A spatio-temporal access method based on snapshots and events. GIS 2005: 115-124
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-04-25 05:42 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:
