The following pages link to Luís M. S. Russo (Q390914):
Displaying 18 items.
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Linking and cutting spanning trees (Q2331458) (← links)
- A study on splay trees (Q2419117) (← links)
- Efficient generation of super condensed neighborhoods (Q2466013) (← links)
- A practical succinct dynamic graph representation (Q2672244) (← links)
- Space-Efficient Data-Analysis Queries on Grids (Q3104627) (← links)
- Fully compressed suffix trees (Q3189038) (← links)
- Dynamic Fully-Compressed Suffix Trees (Q3506953) (← links)
- Parallel and Distributed Compressed Indexes (Q3575260) (← links)
- Small Longest Tandem Scattered Subsequences (Q5089621) (← links)
- (Q5140763) (← links)
- Fully-Compressed Suffix Trees (Q5458543) (← links)
- Combinatorial Pattern Matching (Q5713532) (← links)
