Titlebook: Mathematical and Engineering Methods in Computer Science; 8th International Do Antonín Kučera,Thomas A. Henzinger,David Antoš Conference pr

negligence

Fast Algorithm for Rank-Width,phs of practical relevance to the established bounds of boolean-width. While the width of most graphs is lower than the known values for tree-width, it turns out that the boolean-width heuristic is able to find decompositions of significantly lower width. In a second step we therefore present a furt

CREST

Determinacy in Stochastic Games with Unbounded Payoff Functions,ated along a run, respectively. Since the total accumulated reward is unbounded, the determinacy of such games cannot be deduced directly from Martin’s determinacy result for Blackwell games. Nevertheless, we show that these games . determined both for unrestricted (i.e., history-dependent and rando

radiograph

哀悼

Controllable-Choice Message Sequence Graphs,among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restricted class of MSG, so called controllable-choice MSG, and show that all its models are realizable and moreover it is decidable whether a given MSG mod

支架

废除

揭穿真相

Iatrogenic

Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme, attack from [2] using the NTL library and show that only dimensions up to 128 are feasible for common computational power. We propose also two improvements of this attack that enable us to use the fastest variant of LLL from NTL and compare the results.

hankering

编辑才信任

On WQO Property for Different Quasi Orderings of the Set of Permutations,e of efficient algorithms and also in certain cases to prove that a specific algorithm terminates..One of such sets of interest is the set of permutations. The fact that the set of permutations is not WQO has been rediscovered several times and a number of different permutation antichains have been