FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Two complexity results are shown for the output languages generated by compositions of macro tree transducers. They are in NSPACE(n) and hence are context-sensitive, and the class ...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a core...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...