default search action
Antonio Fariña
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j24]Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña
, Javier D. Fernández, Miguel A. Martínez-Prieto
Compressed and queryable self-indexes for RDF archives. Knowl. Inf. Syst. 66(1): 381-417 (2024) - [i14]Diego Arroyuelo, Fabrizio Barisione, Antonio Fariña
New Compressed Indices for Multijoins on Graph Databases. CoRR abs/2408.00558 (2024) - 2023
- [j23]Nieves R. Brisaboa, Ana Cerdeira-Pena
Space/time-efficient RDF stores based on circular suffix sorting. J. Supercomput. 79(5): 5643-5683 (2023) - 2022
- [j22]Nieves R. Brisaboa, Antonio Fariña
Improved structures to solve aggregated queries for trips over public transportation networks. Inf. Sci. 584: 752-783 (2022) - [j21]Antonio Fariña
A Compact Representation of Indoor Trajectories. IEEE Pervasive Comput. 21(1): 57-64 (2022) - [j20]Antonio Fariña
Efficient and compact representations of some non-canonical prefix-free codes. Theor. Comput. Sci. 907: 11-25 (2022) - 2021
- [j19]Georgios M. Mandilaras, George Papadakis
Reproducible experiments on Three-Dimensional Entity Resolution with JedAI. Inf. Syst. 102: 101830 (2021) - [c41]Nieves R. Brisaboa, Antonio Fariña, Diego Otero-González, Tirso V. Rodeiro
An Efficient Representation of Enriched Temporal Trajectories. DATA 2021: 49-59 - 2020
- [j18]Antonio Hernández-Illera, Miguel A. Martínez-Prieto
iHDT++: improving HDT for SPARQL triple pattern resolution. J. Intell. Fuzzy Syst. 39(2): 2249-2261 (2020) - [c40]Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco:
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CIRCLE 2020 - [c39]Nieves Rodríguez Brisaboa
Semantrix: A Compressed Semantic Matrix. DCC 2020: 113-122 - [c38]Nieves R. Brisaboa
Revisiting Compact RDF Stores Based on k2-Trees. DCC 2020: 123-132 - [i13]Nieves R. Brisaboa, Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña
Revisiting compact RDF stores based on k2-trees. CoRR abs/2002.11622 (2020) - [i12]Nieves R. Brisaboa, Antonio Fariña
Semantrix: A Compressed Semantic Matrix. CoRR abs/2002.12050 (2020) - [i11]Nieves R. Brisaboa, Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña
Space/time-efficient RDF stores based on circular suffix sorting. CoRR abs/2009.10045 (2020)
2010 – 2019
- 2019
- [j17]Antonio Fariña
On the reproducibility of experiments of indexing repetitive document collections. Inf. Syst. 83: 181-194 (2019) - [c37]Nieves R. Brisaboa
Dv2v: A Dynamic Variable-to-Variable Compressor. DCC 2019: 83-92 - [i10]Nieves R. Brisaboa, Antonio Fariña
Dv2v: A Dynamic Variable-to-Variable Compressor. CoRR abs/1911.04202 (2019) - [i9]Nieves R. Brisaboa, Antonio Fariña
New structures to solve aggregated queries for trips over public transportation networks. CoRR abs/1911.09044 (2019) - [i8]Antonio Fariña, Miguel A. Martínez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz, Nicola Prezza, Diego Seco:
On the Reproducibility of Experiments of Indexing Repetitive Document Collections. CoRR abs/1912.11944 (2019) - 2018
- [j16]Nieves R. Brisaboa
A compact representation for trips over networks built on self-indexes. Inf. Syst. 78: 1-22 (2018) - [j15]Nieves R. Brisaboa
Using Compressed Suffix-Arrays for a compact representation of temporal-graphs. Inf. Sci. 465: 459-483 (2018) - [c36]Nieves R. Brisaboa
New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks. SPIRE 2018: 88-101 - [c35]Ana Cerdeira-Pena
Towards a Compact Representation of Temporal Rasters. SPIRE 2018: 117-130 - [i7]Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña
Towards a compact representation of temporal rasters. CoRR abs/1810.10965 (2018) - [i6]Nieves R. Brisaboa, Diego Caro, Antonio Fariña, M. Andrea Rodríguez:
Using Compressed Suffix-Arrays for a Compact Representation of Temporal-Graphs. CoRR abs/1812.11244 (2018) - [i5]Nieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, M. Andrea Rodríguez:
A Compact Representation for Trips over Networks built on self-indexes. CoRR abs/1812.11249 (2018) - 2017
- [c34]Charlie Abela, Antonio Fariña
KEYSTONE Activities and Results Overview on Training Schools. International KEYSTONE Conference 2017: 230-238 - 2016
- [j14]Francisco Claude, Antonio Fariña
Universal indexes for highly repetitive document collections. Inf. Syst. 61: 1-23 (2016) - [j13]Diego Caro, M. Andrea Rodríguez
Compressed kd-tree for temporal graphs. Knowl. Inf. Syst. 49(2): 553-595 (2016) - [j12]Ángeles Saavedra Places
A workflow management system to feed digital libraries: proposal and case study. Multim. Tools Appl. 75(7): 3843-3877 (2016) - [c33]Ana Cerdeira-Pena
Self-Indexing RDF Archives. DCC 2016: 526-535 - [c32]Eduardo Rodríguez López, Ángeles Saavedra Places, Juan-Ramón López, José R. Paramá, Antonio Fariña:
Self-Index Compression in Electronic Publishing. PACIS 2016: 250 - [c31]Antonio Fariña
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes. SPIRE 2016: 50-60 - [c30]Nieves R. Brisaboa
Compact Trip Representation over Networks. SPIRE 2016: 240-253 - [i4]Francisco Claude, Antonio Fariña, Miguel A. Martínez-Prieto, Gonzalo Navarro:
Universal Indexes for Highly Repetitive Document Collections. CoRR abs/1604.08897 (2016) - [i3]Antonio Fariña, Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes. CoRR abs/1605.06615 (2016) - [i2]Nieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, M. Andrea Rodríguez:
Compact Trip Representation over Networks. CoRR abs/1612.04209 (2016) - 2015
- [c29]Nieves R. Brisaboa
A Compact RDF Store Using Suffix Arrays. SPIRE 2015: 103-115 - 2014
- [j11]Antonio Fariña
Indexing and Self-indexing sequences of IEEE 754 double precision numbers. Inf. Process. Manag. 50(6): 857-875 (2014) - [c28]Nieves R. Brisaboa, Diego Caro, Antonio Fariña, M. Andrea Rodríguez:
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing. SPIRE 2014: 77-88 - 2013
- [c27]José Antonio Cotelo Lema, Manuel Barcon-Goas, Antonio Fariña, Miguel Rodríguez Luaces:
Combining Geometry Simplification and Coordinate Approximation Techniques for Better Lossy Compression of GIS Data. DCC 2013: 482 - 2012
- [j10]Antonio Fariña
Boosting Text Compression with Word-Based Statistical Encoding. Comput. J. 55(1): 111-131 (2012) - [j9]Nieves R. Brisaboa
Implicit indexing of natural language text by reorganizing bytecodes. Inf. Retr. 15(6): 527-557 (2012) - [j8]Antonio Fariña
Word-based self-indexes for natural language text. ACM Trans. Inf. Syst. 30(1): 1:1-1:34 (2012) - [c26]Antonio Fariña
Indexing Sequences of IEEE 754 Double Precision Numbers. DCC 2012: 367-376 - 2011
- [j7]Nieves R. Brisaboa
Improving semistatic compression via phrase-based modeling. Inf. Process. Manag. 47(4): 545-559 (2011) - [c25]Francisco Claude, Antonio Fariña
Indexes for highly repetitive document collections. CIKM 2011: 463-468 - 2010
- [j6]Nieves R. Brisaboa
Dynamic lightweight text compression. ACM Trans. Inf. Syst. 28(3): 10:1-10:32 (2010) - [c24]Francisco Claude, Antonio Fariña, Miguel A. Martínez-Prieto
Compressed q-Gram Indexing for Highly Repetitive Biological Sequences. BIBE 2010: 86-91 - [c23]Nieves R. Brisaboa
A New Searchable Variable-to-Variable Compressor. DCC 2010: 199-208
2000 – 2009
- 2009
- [c22]Sandra Álvarez-García, Ana Cerdeira-Pena, Antonio Fariña, Susana Ladra:
Desarrollo de un compresor de textos orientado a palabras basado en PPM. JISBD 2009: 237-248 - [c21]Nieves R. Brisaboa, Antonio Fariña, Susana Ladra, Gonzalo Navarro:
Reorganizing Compressed Text. JISBD 2009: 261-261 - [i1]Francisco Claude, Antonio Fariña, Gonzalo Navarro:
Re-Pair Compression of Inverted Lists. CoRR abs/0911.3318 (2009) - 2008
- [j5]Nieves R. Brisaboa
New adaptive compressors for natural language text. Softw. Pract. Exp. 38(13): 1429-1450 (2008) - [c20]Antonio Fariña
Word-Based Statistical Compressors as Natural Language Compression Boosters. DCC 2008: 162-171 - [c19]Nieves R. Brisaboa
Reorganizing compressed text. SIGIR 2008: 139-146 - [c18]Yolanda Cillero, Susana Ladra, Nieves R. Brisaboa, Antonio Fariña, Oscar Pedreira:
Implementing byte-oriented rank and select operations. SOFSEM (2) 2008: 34-45 - [c17]Nieves R. Brisaboa
Self-indexing Natural Language. SPIRE 2008: 121-132 - [c16]Antonio Fariña, Susana Ladra
Rank and Select for Succinct Data Structures. VODCA@FOSAD 2008: 131-145 - 2007
- [j4]Nieves R. Brisaboa
Lightweight natural language text compression. Inf. Retr. 10(1): 1-33 (2007) - [j3]Ángeles Saavedra Places, Nieves R. Brisaboa
The Galician virtual library. Online Inf. Rev. 31(3): 333-352 (2007) - [j2]Nieves R. Brisaboa
Collecting and publishing large multiscale geographic datasets. Softw. Pract. Exp. 37(12): 1319-1348 (2007) - [c15]Nieves R. Brisaboa
Definition and Implementation of an Active Web Map Service. AGILE Conf. 2007: 231-245 - [c14]Nieves R. Brisaboa
A New Approach for Document Indexing UsingWavelet Trees. DEXA Workshops 2007: 69-73 - [c13]Nieves R. Brisaboa, Antonio Fariña, Oscar Pedreira, Nora Reyes:
Indexación dinámica para la recuperación de información basada en búsqueda por similitud. JISBD 2007: 134-143 - [c12]Eduardo Rodríguez, Antonio Fariña, Ángeles Saavedra Places, José R. Paramá, Oscar Pedreira:
WCSA: Un autoíndice orientado a palabras para textos en lenguaje natural. JISBD 2007: 144-153 - 2006
- [c11]Nieves R. Brisaboa
Chase of Recursive Queries. Ershov Memorial Conference 2006: 112-123 - [c10]Nieves R. Brisaboa
Improving Semistatic Compression Via Pair-Based Coding. Ershov Memorial Conference 2006: 124-134 - [c9]Nieves R. Brisaboa
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval. ISM 2006: 881-888 - 2005
- [c8]Nieves R. Brisaboa
Compressing Dynamic Text Collections via Phrase-Based Coding. ECDL 2005: 462-474 - [c7]Nieves R. Brisaboa
Efficiently decodable and searchable natural language adaptive compression. SIGIR 2005: 234-241 - 2004
- [c6]Carolina Bonacic, Antonio Fariña, Mauricio Marín
Compressing Distributed Text in Parallel with (s, c)-Dense Codes. SCCC 2004: 93-98 - [c5]Nieves R. Brisaboa
Simple, Fast, and Efficient Natural Language Adaptive Compression.. SPIRE 2004: 230-241 - [c4]Antonio Fariña
Fast and Flexible Compression for Web Search Engines. VODCA@FOSAD 2004: 129-141 - 2003
- [j1]Nieves R. Brisaboa, Antonio Fariña
Using Geographical Information Systems to Browse Touristic Information. J. Inf. Technol. Tour. 6(1): 31-46 (2003) - [c3]Eva Lorenzo Iglesias, Nieves R. Brisaboa, José R. Paramá, Antonio Fariña, Gonzalo Navarro, María F. Esteller:
Usando técnicas de compresión de textos en bibliotecas digitales. JBIDI 2003: 39-48 - [c2]Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, Eva Lorenzo Iglesias, José R. Paramá, María F. Esteller:
Codificación (s, c)-Densa: optimizando la compresión de texto en lenguaje natural. JISBD 2003: 737-746 - [c1]Nieves R. Brisaboa
(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases. SPIRE 2003: 122-136
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-10-07 21:22 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: