RELMICS
2009
Springer
14 years 6 months ago
2009
Springer
MFCS
2009
Springer
14 years 7 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
14 years 7 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
MFCS
2009
Springer
14 years 7 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...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
