32 search results - page 4 / 7 » fsttcs 2008 |
FSTTCS
2008
Springer
14 years 11 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
14 years 11 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
FSTTCS
2008
Springer
14 years 11 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
14 years 11 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 ...