Francisco Claude

Alejandro Pacheco

J. Comput. Syst. Sci., 2021

2019

On the reproducibility of experiments of indexing repetitive document collections.

[BibT_eX]

[DOI]

Inf. Syst., 2019

2017

Competitive Author Profiling Using Compression-Based Strategies.

[BibT_eX]

[DOI]

Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2017

2016

Practical compressed string dictionaries.

[BibT_eX]

[DOI]

Inf. Syst., 2016

Universal indexes for highly repetitive document collections.

[BibT_eX]

[DOI]

Inf. Syst., 2016

Compression-Inspired Author Profiling.

[BibT_eX]

[DOI]

Roberto Konow

Susana Ladra

Proceedings of the 2016 Data Compression Conference, 2016

Fast compressed-based strategies for author profiling of social media texts.

[BibT_eX]

[DOI]

Roberto Konow

Susana Ladra

Proceedings of the 4th Spanish Conference on Information Retrieval, 2016

2015

Fast in-memory XPath search using compressed indexes.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2015

The wavelet matrix: An efficient wavelet tree for large alphabets.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

Inf. Syst., 2015

2014

On the compression of search trees.

[BibT_eX]

[DOI]

Diego Seco

Inf. Process. Manag., 2014

Efficient Compressed Wavelet Trees over Large Alphabets.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

CoRR, 2014

Efficient Fully-Compressed Sequence Representations.

[BibT_eX]

[DOI]

Algorithmica, 2014

Efficient Indexing and Representation of Web Access Logs.

[BibT_eX]

[DOI]

Roberto Konow

Proceedings of the String Processing and Information Retrieval, 2014

2013

Space-Efficient Data Structures for Information Retrieval.

[BibT_eX]

[DOI]

PhD thesis, 2013

Compact binary relation representations with rich functionality.

[BibT_eX]

[DOI]

Jérémy Barbay

Inf. Comput., 2013

Broadcasting in Conflict-Aware Multi-channel Networks.

[BibT_eX]

[DOI]

Reza Dorrigiv

Shahin Kamali

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Document Listing on Versioned Documents.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the String Processing and Information Retrieval, 2013

Adaptive Data Structures for Permutations and Binary Relations.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the String Processing and Information Retrieval, 2013

2012

Word-based self-indexes for natural language text.

[BibT_eX]

[DOI]

Ángeles Saavedra Places

Eduardo Rodríguez

ACM Trans. Inf. Syst., 2012

String matching with alphabet sampling.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Improved Grammar-Based Compressed Indexes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

The Wavelet Matrix.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Differentially Encoded Search Trees.

[BibT_eX]

[DOI]

Diego Seco

Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

2011

Untangled monotonic chains and adaptive range search.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Self-Indexed Grammar-Based Compression.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Compressed String Dictionaries.

[BibT_eX]

[DOI]

Nieves R. Brisaboa

Rodrigo Cánovas

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Space Efficient Wavelet Tree Construction.

[BibT_eX]

[DOI]

Diego Seco

Proceedings of the String Processing and Information Retrieval, 2011

Practical representations for web and social graphs.

[BibT_eX]

[DOI]

Susana Ladra

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Indexes for highly repetitive document collections.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Fast and Compact Web Graph Representations.

[BibT_eX]

[DOI]

ACM Trans. Web, 2010

An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.

[BibT_eX]

[DOI]

Bradford G. Nickerson

Alejandro Salinger

Discret. Math. Algorithms Appl., 2010

Range Queries over Untangled Chains.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the String Processing and Information Retrieval, 2010

Compact Rich-Functional Binary Relation Representations.

[BibT_eX]

[DOI]

Jérémy Barbay

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Extended Compact Web Graph Representations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Applications, 2010

Compressed q-Gram Indexing for Highly Repetitive Biological Sequences.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010

2009

Re-Pair Compression of Inverted Lists

[BibT_eX]

[DOI]

CoRR, 2009

Fast In-Memory XPath Search over Compressed Text and Tree Indexes

[BibT_eX]

[DOI]

CoRR, 2009

Self-indexed Text Compression Using Straight-Line Programs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.

[BibT_eX]

[DOI]

Alejandro Salinger

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

E-Breaker: Flexible, distributed environment for collaborative authoring.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Computers Supported Cooperative Work in Design, 2009

2008

Speeding Up Pattern Matching by Text Sampling.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2008

Practical Rank/Select Queries over Arbitrary Sequences.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2008

2007

A Fast and Compact Web Graph Representation.

[BibT_eX]

[DOI]