Luís M. S. Russo

According to our database, Luís M. S. Russo authored at least 49 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Searching for a Feedback Vertex Set with the link-cut tree.

Luís M. S. Russo

J. Comput. Sci., September, 2023

On Finding Optimal (Dynamic) Arborescences.

Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz

Algorithms, 2023

A Novel Triangular Space-Filling Curve for Cache-Oblivious In-Place Transposition of Square Matrices.

João Nuno Ferreira Alves, Luís M. S. Russo, Alexandre P. Francisco, Siegfried Benkner

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

Cache-oblivious Hilbert Curve-based Blocking Scheme for Matrix Transposition.

João Nuno Ferreira Alves, Luís Manuel Silveira Russo, Alexandre P. Francisco

ACM Trans. Math. Softw., December, 2022

Range minimum queries in minimal space.

Luís M. S. Russo

Theor. Comput. Sci., 2022

Order-preserving pattern matching indeterminate strings.

Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco

Inf. Comput., 2022

A practical succinct dynamic graph representation.

Miguel E. Coimbra, Joana Hrotkó, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro

Inf. Comput., 2022

Stochastic simulated annealing for directed feedback vertex set.

Luís M. S. Russo, Daniel Castro, Aleksandar Ilic, Paolo Romano, Ana Sofia D. Correia

Appl. Soft Comput., 2022

2021

Small Longest Tandem Scattered Subsequences.

Luís M. S. Russo, Alexandre P. Francisco

Sci. Ann. Comput. Sci., 2021

2020

Cartesian and Lyndon trees.

Maxime Crochemore, Luís M. S. Russo

Theor. Comput. Sci., 2020

Hardness of Modern Games.

Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo

CoRR, 2020

Incremental Multiple Longest Common Sub-Sequences.

Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher

CoRR, 2020

Sparsifying parity-check matrices.

Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika

Appl. Soft Comput., 2020

More Time-Space Tradeoffs for Finding a Shortest Unique Substring.

Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo

Algorithms, 2020

Approximating Optimal Bidirectional Macro Schemes.

Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco

Proceedings of the Data Compression Conference, 2020

On Dynamic Succinct Graph Representations.

Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro

Proceedings of the Data Compression Conference, 2020

2019

A study on splay trees.

Luís M. S. Russo

Theor. Comput. Sci., 2019

Flying tourist problem: Flight time and cost minimization in complex routes.

Rafael Marques, Luís M. S. Russo, Nuno Roma

Expert Syst. Appl., 2019

2018

Linking and Cutting Spanning Trees.

Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco

Algorithms, 2018

Order-Preserving Pattern Matching Indeterminate Strings.

Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Cartesian trees and Lyndon trees.

Maxime Crochemore, Luís M. S. Russo

CoRR, 2017

2016

Compressed Suffix Trees.

Luís M. S. Russo

Encyclopedia of Algorithms, 2016

Extending quick hypervolume.

Luís M. S. Russo, Alexandre P. Francisco

J. Heuristics, 2016

2015

Improving Bilingual Search Performance Using Compact Full-Text Indices.

Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo

Proceedings of the Computational Linguistics and Intelligent Text Processing, 2015

2014

Quick Hypervolume.

Luís M. S. Russo, Alexandre P. Francisco

IEEE Trans. Evol. Comput., 2014

Data Management in Metagenomics: A Risk Management Approach.

Filipe Ferreira, Miguel E. Coimbra, Raquel Bairrão, Ricardo Viera, Ana T. Freitas, Luís M. S. Russo, José Borbinha

Int. J. Digit. Curation, 2014

Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER.

Miguel Ferreira, Nuno Roma, Luís M. S. Russo

BMC Bioinform., 2014

Fast Fully-Compressed Suffix Trees.

Gonzalo Navarro, Luís M. S. Russo

Proceedings of the Data Compression Conference, 2014

2013

Space-efficient data-analysis queries on grids.

Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo

Theor. Comput. Sci., 2013

Parallel efficient aligner of pyrosequencing reads.

Miguel E. Coimbra, Francisco Fernandes, Luís M. S. Russo, Ana T. Freitas

Proceedings of the 20th European MPI Users's Group Meeting, 2013

Compact and Fast Indexes for Translation Related Tasks.

Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo, Nieves R. Brisaboa

Proceedings of the Progress in Artificial Intelligence, 2013

2012

Monge properties of sequence alignment.

Luís M. S. Russo

Theor. Comput. Sci., 2012

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis.

Susana Vinga, Alexandra M. Carvalho, Alexandre P. Francisco, Luís M. S. Russo, Jonas S. Almeida

Algorithms Mol. Biol., 2012

2011

Fully compressed suffix trees.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira

ACM Trans. Algorithms, 2011

Efficient alignment of pyrosequencing reads for re-sequencing applications.

Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, Ana T. Freitas

BMC Bioinform., 2011

Succinct Gapped Suffix Arrays.

Luís M. S. Russo, German Tischler

Proceedings of the String Processing and Information Retrieval, 2011

Representing a bilingual lexicon with suffix trees.

Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, Luís M. S. Russo

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

Space-Efficient Data-Analysis Queries on Grids.

Gonzalo Navarro, Luís M. S. Russo

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Multiplication Algorithms for Monge Matrices.

Luís M. S. Russo

Proceedings of the String Processing and Information Retrieval, 2010

Parallel and Distributed Compressed Indexes.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Approximate String Matching with Compressed Indexes.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales

Algorithms, 2009

2008

A compressed self-index using a Ziv-Lempel dictionary.

Luís M. S. Russo, Arlindo L. Oliveira

Inf. Retr., 2008

Indexed Hierarchical Approximate String Matching.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira

Proceedings of the String Processing and Information Retrieval, 2008

Re-pair Achieves High-Order Entropy.

Gonzalo Navarro, Luís M. S. Russo

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Dynamic Fully-Compressed Suffix Trees.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Efficient generation of super condensed neighborhoods.

Luís M. S. Russo, Arlindo L. Oliveira

J. Discrete Algorithms, 2007

Approximate String Matching with Lempel-Ziv Compressed Indexes.

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira

Proceedings of the String Processing and Information Retrieval, 2007

2005

Faster Generation of Super Condensed Neighbourhoods Using Finite Automata.

Luís M. S. Russo, Arlindo L. Oliveira

Proceedings of the String Processing and Information Retrieval, 2005

An Efficient Algorithm for Generating Super Condensed Neighborhoods.

Luís M. S. Russo, Arlindo L. Oliveira

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005