Luís M. S. Russo

64 papers A 2B 10C 7Misc 2Journal 41Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Accelerating Graph Neural Networks Using a Novel Computation-Friendly Matrix Compression Format. IPDPS João Nuno Ferreira Alves, Samir Moustafa, Siegfried Benkner, Alexandre P. Francisco, Wilfried N. Gansterer, Luís M. S. Russo
2025	J	`jnl`	Implementing the Link-Cut Tree. Softw. Pract. Exp. Luís M. S. Russo
2024	J	`jnl`	Accelerating Graph Neural Networks with a Novel Matrix Compression Format. CoRR João Nuno Ferreira Alves, Samir Moustafa, Siegfried Benkner, Alexandre P. Francisco, Wilfried N. Gansterer, Luís M. S. Russo
2023	A	`conf`	A Novel Triangular Space-Filling Curve for Cache-Oblivious In-Place Transposition of Square Matrices. IPDPS João Nuno Ferreira Alves, Luís M. S. Russo, Alexandre P. Francisco, Siegfried Benkner
2023	J	`jnl`	On Finding Optimal (Dynamic) Arborescences. Algorithms Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz
2023	J	`jnl`	On Finding Optimal (Dynamic) Arborescences. CoRR Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz
2023	J	`jnl`	Searching for a Feedback Vertex Set with the link-cut tree. J. Comput. Sci. Luís M. S. Russo
2022	J	`jnl`	A practical succinct dynamic graph representation. Inf. Comput. Miguel E. Coimbra, Joana Hrotkó, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
2022	J	`jnl`	Order-preserving pattern matching indeterminate strings. Inf. Comput. Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
2022	J	`jnl`	Range minimum queries in minimal space. Theor. Comput. Sci. Luís M. S. Russo
2022	J	`jnl`	Stochastic simulated annealing for directed feedback vertex set. Appl. Soft Comput. Luís M. S. Russo, Daniel Castro, Aleksandar Ilic, Paolo Romano, Ana Sofia D. Correia
2021	J	`jnl`	Range Minimum Queries in Minimal Space. CoRR Luís M. S. Russo
2021	J	`jnl`	Small Longest Tandem Scattered Subsequences. Sci. Ann. Comput. Sci. Luís M. S. Russo, Alexandre P. Francisco
2020	B	`conf`	Approximating Optimal Bidirectional Macro Schemes. DCC Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco
2020	J	`jnl`	Approximating Optimal Bidirectional Macro Schemes. CoRR Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco
2020	J	`jnl`	Cartesian and Lyndon trees. Theor. Comput. Sci. Maxime Crochemore, Luís M. S. Russo
2020	J	`jnl`	Hardness of Modern Games. CoRR Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo
2020	J	`jnl`	Incremental Multiple Longest Common Sub-Sequences. CoRR Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher
2020	J	`jnl`	More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo
2020	B	`conf`	On Dynamic Succinct Graph Representations. DCC Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
2020	J	`jnl`	Small Longest Tandem Scattered Subsequences. CoRR Luís M. S. Russo, Alexandre P. Francisco
2020	J	`jnl`	Sparsifying Parity-Check Matrices. CoRR Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika
2020	J	`jnl`	Sparsifying parity-check matrices. Appl. Soft Comput. Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika
2019	J	`jnl`	A study on splay trees. Theor. Comput. Sci. Luís M. S. Russo
2019	J	`jnl`	Flying tourist problem: Flight time and cost minimization in complex routes. Expert Syst. Appl. Rafael Marques, Luís M. S. Russo, Nuno Roma
2019	J	`jnl`	On dynamic succinct graph representations. CoRR Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
2019	J	`jnl`	Order-Preserving Pattern Matching Indeterminate Strings. CoRR Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
2018	J	`jnl`	Linking and Cutting Spanning Trees. Algorithms Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco
2018	J	`jnl`	Linking and Cutting Spanning Trees. CoRR Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco
2018	B	`conf`	Order-Preserving Pattern Matching Indeterminate Strings. CPM Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai
2017	J	`jnl`	Cartesian trees and Lyndon trees. CoRR Maxime Crochemore, Luís M. S. Russo
2016	—	`ch.`	Compressed Suffix Trees. Encyclopedia of Algorithms Luís M. S. Russo
2016	J	`jnl`	Extending quick hypervolume. J. Heuristics Luís M. S. Russo, Alexandre P. Francisco
2015	J	`jnl`	A Study on Splay Trees. CoRR Luís M. S. Russo
2015	—	`conf`	Improving Bilingual Search Performance Using Compact Full-Text Indices. CICLing (1) Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo
2014	J	`jnl`	Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER. BMC Bioinform. Miguel Ferreira, Nuno Roma, Luís M. S. Russo
2014	J	`jnl`	Data Management in Metagenomics: A Risk Management Approach. Int. J. Digit. Curation Filipe Ferreira, Miguel E. Coimbra, Raquel Bairrão, Ricardo Viera, Ana T. Freitas, Luís M. S. Russo, José Borbinha
2014	B	`conf`	Fast Fully-Compressed Suffix Trees. DCC Gonzalo Navarro, Luís M. S. Russo
2014	J	`jnl`	Quick Hypervolume. IEEE Trans. Evol. Comput. Luís M. S. Russo, Alexandre P. Francisco
2013	Misc	`conf`	Compact and Fast Indexes for Translation Related Tasks. EPIA Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo, Nieves R. Brisaboa
2013	C	`conf`	Parallel efficient aligner of pyrosequencing reads. EuroMPI Miguel E. Coimbra, Francisco Fernandes, Luís M. S. Russo, Ana T. Freitas
2013	J	`jnl`	Space-efficient data-analysis queries on grids. Theor. Comput. Sci. Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo
2012	J	`jnl`	Monge properties of sequence alignment. Theor. Comput. Sci. Luís M. S. Russo
2012	J	`jnl`	Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms Mol. Biol. Susana Vinga, Alexandra M. Carvalho, Alexandre P. Francisco, Luís M. S. Russo, Jonas S. Almeida
2012	J	`jnl`	Quick HyperVolume CoRR Luís M. S. Russo, Alexandre P. Francisco
2011	J	`jnl`	Efficient alignment of pyrosequencing reads for re-sequencing applications. BMC Bioinform. Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, Ana T. Freitas
2011	J	`jnl`	Fully compressed suffix trees. ACM Trans. Algorithms Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2011	Misc	`conf`	Representing a bilingual lexicon with suffix trees. SAC Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, Luís M. S. Russo
2011	J	`jnl`	Space-Efficient Data-Analysis Queries on Grids CoRR Gonzalo Navarro, Luís M. S. Russo
2011	B	`conf`	Space-Efficient Data-Analysis Queries on Grids. ISAAC Gonzalo Navarro, Luís M. S. Russo
2011	C	`conf`	Succinct Gapped Suffix Arrays. SPIRE Luís M. S. Russo, German Tischler
2010	C	`conf`	Multiplication Algorithms for Monge Matrices. SPIRE Luís M. S. Russo
2010	B	`conf`	Parallel and Distributed Compressed Indexes. CPM Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2009	J	`jnl`	Approximate String Matching with Compressed Indexes. Algorithms Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales
2008	J	`jnl`	A compressed self-index using a Ziv-Lempel dictionary. Inf. Retr. Luís M. S. Russo, Arlindo L. Oliveira
2008	B	`conf`	Dynamic Fully-Compressed Suffix Trees. CPM Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2008	B	`conf`	Fully-Compressed Suffix Trees. LATIN Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2008	C	`conf`	Indexed Hierarchical Approximate String Matching. SPIRE Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2008	B	`conf`	Re-pair Achieves High-Order Entropy. DCC Gonzalo Navarro, Luís M. S. Russo
2007	C	`conf`	Approximate String Matching with Lempel-Ziv Compressed Indexes. SPIRE Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2007	J	`jnl`	Efficient generation of super condensed neighborhoods. J. Discrete Algorithms Luís M. S. Russo, Arlindo L. Oliveira
2006	C	`conf`	A Compressed Self-index Using a Ziv-Lempel Dictionary. SPIRE Luís M. S. Russo, Arlindo L. Oliveira
2005	B	`conf`	An Efficient Algorithm for Generating Super Condensed Neighborhoods. CPM Luís M. S. Russo, Arlindo L. Oliveira
2005	C	`conf`	Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. SPIRE Luís M. S. Russo, Arlindo L. Oliveira