7 citations · 17 across the 8 of their papers we have counts for
13 papers
Range Minimum Queries in Minimal Space
Luís M. S. Russo
We consider the problem of computing a sequence of range minimum queries. We assume a sequence of commands that contains values and queries. Our goal is to quickly determine the mi…
Small Longest Tandem Scattered Subsequences
Luís M. S. Russo, Alexandre P. Francisco
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.…
Hardness of Modern Games
Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo
We consider the complexity properties of modern puzzle games, Hexiom, Cut the Rope and Back to Bed. The complexity of games plays an important role in the type of experience they p…
Sparsifying Parity-Check Matrices
Luís M. S. Russo, Tobias Dietz, José Rui Figueira +2
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code…
Incremental Multiple Longest Common Sub-Sequences
Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher
We consider the problem of updating the information about multiple longest common sub-sequences. This kind of sub-sequences is used to highlight information that is shared across s…
Approximating Optimal Bidirectional Macro Schemes
Luís M. S. Russo, Ana D. Correia, Gonzalo Navarro +1
Lempel-Ziv is an easy-to-compute member of a wide family of so-called macro schemes; it restricts pointers to go in one direction only. Optimal bidirectional macro schemes are NP-c…