MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with th...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...