We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...