List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Order-preserving pattern matching indeterminate strings Information and Computation | 2022-12-08 | Paper |
| Small Longest Tandem Scattered Subsequences Scientific Annals of Computer Science | 2022-07-19 | Paper |
| A practical succinct dynamic graph representation Information and Computation | 2022-06-08 | Paper |
| Range minimum queries in minimal space Theoretical Computer Science | 2022-03-01 | Paper |
| Order-preserving pattern matching indeterminate strings (available as arXiv preprint) | 2020-12-16 | Paper |
| Cartesian and Lyndon trees Theoretical Computer Science | 2020-01-16 | Paper |
| Linking and cutting spanning trees Algorithms | 2019-10-29 | Paper |
| A study on splay trees Theoretical Computer Science | 2019-05-29 | Paper |
| Approximate string matching with compressed indexes Algorithms | 2018-08-20 | Paper |
| Fully compressed suffix trees ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Space-efficient data-analysis queries on grids Theoretical Computer Science | 2014-01-09 | Paper |
| Monge properties of sequence alignment Theoretical Computer Science | 2012-05-14 | Paper |
| Space-efficient data-analysis queries on grids Algorithms and Computation | 2011-12-16 | Paper |
| Parallel and distributed compressed indexes Combinatorial Pattern Matching | 2010-07-26 | Paper |
| Dynamic Fully-Compressed Suffix Trees Combinatorial Pattern Matching | 2008-06-17 | Paper |
| Fully-Compressed Suffix Trees Lecture Notes in Computer Science | 2008-04-15 | Paper |
| Efficient generation of super condensed neighborhoods Journal of Discrete Algorithms | 2008-01-11 | Paper |
| Combinatorial Pattern Matching Lecture Notes in Computer Science | 2005-12-14 | Paper |
Research outcomes over time
This page was built for person: Luís M. S. Russo
