Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuís M. S. Russo
Person information
- affiliation: INESC-ID, Lisbon, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j26]Joaquim Espada, Alexandre P. Francisco
, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz:
On Finding Optimal (Dynamic) Arborescences. Algorithms 16(12): 559 (2023)- [j25]Luís M. S. Russo:
Searching for a Feedback Vertex Set with the link-cut tree. J. Comput. Sci. 72: 102110 (2023) - 2022
- [j24]Luís M. S. Russo, Daniel Castro, Aleksandar Ilic, Paolo Romano, Ana Sofia D. Correia:
Stochastic simulated annealing for directed feedback vertex set. Appl. Soft Comput. 129: 109607 (2022) - [j23]Miguel E. Coimbra, Joana Hrotkó, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro:
A practical succinct dynamic graph representation. Inf. Comput. 285(Part): 104862 (2022) - [j22]Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco:
Order-preserving pattern matching indeterminate strings. Inf. Comput. 289(Part): 104924 (2022) - [j21]Luís M. S. Russo:
Range minimum queries in minimal space. Theor. Comput. Sci. 909: 19-38 (2022) - [j20]João Nuno Ferreira Alves, Luís Manuel Silveira Russo, Alexandre P. Francisco:
Cache-oblivious Hilbert Curve-based Blocking Scheme for Matrix Transposition. ACM Trans. Math. Softw. 48(4): 37:1-37:28 (2022) - 2021
- [j19]Luís M. S. Russo, Alexandre P. Francisco:
Small Longest Tandem Scattered Subsequences. Sci. Ann. Comput. Sci. 31(1): 79-110 (2021) - 2020
- [j18]Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo:
More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms 13(9): 234 (2020) - [j17]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying parity-check matrices. Appl. Soft Comput. 96: 106601 (2020) - [j16]Maxime Crochemore, Luís M. S. Russo:
Cartesian and Lyndon trees. Theor. Comput. Sci. 806: 1-9 (2020) - 2019
- [j15]Rafael Marques, Luís M. S. Russo, Nuno Roma:
Flying tourist problem: Flight time and cost minimization in complex routes. Expert Syst. Appl. 130: 172-187 (2019) - [j14]Luís M. S. Russo:
A study on splay trees. Theor. Comput. Sci. 776: 1-18 (2019) - 2018
- [j13]Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco:
Linking and Cutting Spanning Trees. Algorithms 11(4): 53 (2018) - 2016
- [j12]Luís M. S. Russo, Alexandre P. Francisco:
Extending quick hypervolume. J. Heuristics 22(3): 245-271 (2016) - 2014
- [j11]Miguel Ferreira, Nuno Roma, Luís M. S. Russo:
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER. BMC Bioinform. 15: 165 (2014) - [j10]Filipe Ferreira, Miguel E. Coimbra, Raquel Bairrão, Ricardo Viera, Ana T. Freitas, Luís M. S. Russo, José Borbinha:
Data Management in Metagenomics: A Risk Management Approach. Int. J. Digit. Curation 9(1): 41-56 (2014) - [j9]Luís M. S. Russo, Alexandre P. Francisco:
Quick Hypervolume. IEEE Trans. Evol. Comput. 18(4): 481-502 (2014) - 2013
- [j8]Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo:
Space-efficient data-analysis queries on grids. Theor. Comput. Sci. 482: 60-72 (2013) - 2012
- [j7]Susana Vinga, Alexandra M. Carvalho, Alexandre P. Francisco, Luís M. S. Russo, Jonas S. Almeida:
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms Mol. Biol. 7: 10 (2012) - [j6]Luís M. S. Russo:
Monge properties of sequence alignment. Theor. Comput. Sci. 423: 30-49 (2012) - 2011
- [j5]Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, Ana T. Freitas:
Efficient alignment of pyrosequencing reads for re-sequencing applications. BMC Bioinform. 12: 163 (2011) - [j4]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Fully compressed suffix trees. ACM Trans. Algorithms 7(4): 53:1-53:34 (2011) - 2009
- [j3]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales:
Approximate String Matching with Compressed Indexes. Algorithms 2(3): 1105-1136 (2009) - 2008
- [j2]Luís M. S. Russo, Arlindo L. Oliveira:
A compressed self-index using a Ziv-Lempel dictionary. Inf. Retr. 11(4): 359-388 (2008) - 2007
- [j1]Luís M. S. Russo, Arlindo L. Oliveira:
Efficient generation of super condensed neighborhoods. J. Discrete Algorithms 5(3): 501-513 (2007)
Conference and Workshop Papers
- 2023
- [c21]João Nuno Ferreira Alves, Luís M. S. Russo, Alexandre P. Francisco, Siegfried Benkner:
A Novel Triangular Space-Filling Curve for Cache-Oblivious In-Place Transposition of Square Matrices. IPDPS 2023: 368-378 - 2020
- [c20]Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco:
Approximating Optimal Bidirectional Macro Schemes. DCC 2020: 153-162 - [c19]Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro:
On Dynamic Succinct Graph Representations. DCC 2020: 213-222 - 2018
- [c18]Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai:
Order-Preserving Pattern Matching Indeterminate Strings. CPM 2018: 2:1-2:15 - 2015
- [c17]Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo:
Improving Bilingual Search Performance Using Compact Full-Text Indices. CICLing (1) 2015: 582-595 - 2014
- [c16]Gonzalo Navarro, Luís M. S. Russo:
Fast Fully-Compressed Suffix Trees. DCC 2014: 283-291 - 2013
- [c15]Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo, Nieves R. Brisaboa:
Compact and Fast Indexes for Translation Related Tasks. EPIA 2013: 504-515 - [c14]Miguel E. Coimbra, Francisco Fernandes, Luís M. S. Russo, Ana T. Freitas:
Parallel efficient aligner of pyrosequencing reads. EuroMPI 2013: 241-246 - 2011
- [c13]Gonzalo Navarro, Luís M. S. Russo:
Space-Efficient Data-Analysis Queries on Grids. ISAAC 2011: 323-332 - [c12]Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, Luís M. S. Russo:
Representing a bilingual lexicon with suffix trees. SAC 2011: 1164-1165 - [c11]Luís M. S. Russo, German Tischler:
Succinct Gapped Suffix Arrays. SPIRE 2011: 290-294 - 2010
- [c10]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Parallel and Distributed Compressed Indexes. CPM 2010: 348-360 - [c9]Luís M. S. Russo:
Multiplication Algorithms for Monge Matrices. SPIRE 2010: 94-105 - 2008
- [c8]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Dynamic Fully-Compressed Suffix Trees. CPM 2008: 191-203 - [c7]Gonzalo Navarro, Luís M. S. Russo:
Re-pair Achieves High-Order Entropy. DCC 2008: 537 - [c6]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Fully-Compressed Suffix Trees. LATIN 2008: 362-373 - [c5]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Indexed Hierarchical Approximate String Matching. SPIRE 2008: 144-154 - 2007
- [c4]Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira:
Approximate String Matching with Lempel-Ziv Compressed Indexes. SPIRE 2007: 264-275 - 2006
- [c3]Luís M. S. Russo, Arlindo L. Oliveira:
A Compressed Self-index Using a Ziv-Lempel Dictionary. SPIRE 2006: 163-180 - 2005
- [c2]Luís M. S. Russo, Arlindo L. Oliveira:
An Efficient Algorithm for Generating Super Condensed Neighborhoods. CPM 2005: 104-115 - [c1]Luís M. S. Russo, Arlindo L. Oliveira:
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. SPIRE 2005: 246-255
Reference Works
- 2016
- [r1]Luís M. S. Russo:
Compressed Suffix Trees. Encyclopedia of Algorithms 2016: 390-394
Informal and Other Publications
- 2023
- [i14]Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz:
On Finding Optimal (Dynamic) Arborescences. CoRR abs/2311.03262 (2023) - 2021
- [i13]Luís M. S. Russo:
Range Minimum Queries in Minimal Space. CoRR abs/2102.09463 (2021) - 2020
- [i12]Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco:
Approximating Optimal Bidirectional Macro Schemes. CoRR abs/2003.02336 (2020) - [i11]Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher:
Incremental Multiple Longest Common Sub-Sequences. CoRR abs/2005.02725 (2020) - [i10]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying Parity-Check Matrices. CoRR abs/2005.05051 (2020) - [i9]Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo:
Hardness of Modern Games. CoRR abs/2005.10506 (2020) - [i8]Luís M. S. Russo, Alexandre P. Francisco:
Small Longest Tandem Scattered Subsequences. CoRR abs/2006.14029 (2020) - 2019
- [i7]Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco:
Order-Preserving Pattern Matching Indeterminate Strings. CoRR abs/1905.02589 (2019) - [i6]Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro:
On dynamic succinct graph representations. CoRR abs/1911.03195 (2019) - 2018
- [i5]Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco:
Linking and Cutting Spanning Trees. CoRR abs/1801.06846 (2018) - 2017
- [i4]Maxime Crochemore, Luís M. S. Russo:
Cartesian trees and Lyndon trees. CoRR abs/1712.08749 (2017) - 2015
- [i3]Luís M. S. Russo:
A Study on Splay Trees. CoRR abs/1511.03148 (2015) - 2012
- [i2]Luís M. S. Russo, Alexandre P. Francisco:
Quick HyperVolume. CoRR abs/1207.4598 (2012) - 2011
- [i1]Gonzalo Navarro, Luís M. S. Russo:
Space-Efficient Data-Analysis Queries on Grids. CoRR abs/1106.4649 (2011)
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-05-02 23:50 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:
