35 search results - page 7 / 7 » mfcs 2009 |
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We consider ļ¬nite graphs whose edges are labeled with elements, called colors, taken from a ļ¬xed ļ¬nite alphabet. We study the problem of determining whether there is an inļ¬...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
The core of a cooperative game contains all stable distributions of a coalitionās gains among its members. However, some games have an empty core, with every distribution being ...
MFCS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for preļ¬xfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...